Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F13%3APU106371" target="_blank" >RIV/00216305:26230/13:PU106371 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets
Original language description
The paper describes a technique for computing algorithm for constructing unfoldings of unbounded hybrid Petri nets. The motivation for introducing unfoldings for hybrid Petri nets is that this technique can cope well with the so-called state space explosion problem especially for the Petri nets with a lot of concurrency. This contribution extends our previous work and formalizes the concept of the unfoldings for autonomous hybrid Petri nets, introduces an algorithm for their computing and shows new results.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Computer Aided System Theory -EUROCAST 2013 - revised selected papers
ISBN
978-3-642-53855-1
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
428-435
Publisher name
Springer Verlag
Place of publication
Berín
Event location
Las Palmas de Gran Canaria
Event date
Feb 10, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)