Unfoldings of Bounded Hybrid Petri Nets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU98182" target="_blank" >RIV/00216305:26230/12:PU98182 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Unfoldings of Bounded Hybrid Petri Nets
Original language description
The unfolding is a useful partial-order based method for analysis and verification of the Petri net properties. This technique can cope well with the so-called state space explosion problem, especially for the Petri nets with a lot of concurrency. The paper formalizes the concept of the unfolding for bounded hybrid Petri nets and introduces the algorithm for its computing.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F10%2F0306" target="_blank" >GAP103/10/0306: Static and Dynamic Verification of Programs with Advanced Features of Concurrency and Unboundedness</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
2012
Issue of the periodical within the volume
6927
Country of publishing house
DE - GERMANY
Number of pages
8
Pages from-to
543-550
UT code for WoS article
—
EID of the result in the Scopus database
—