Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
NOVOSAD, P. ČEŠKA, M.
Originální název
Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets
Typ
článek ve sborníku mimo WoS a Scopus
Jazyk
angličtina
Originální abstrakt
The paper describes a technique for computing algorithm for constructing unfoldings of unbounded hybrid Petri nets. The unfolding is a useful partial-order method for analysis and verification of the Petri net properties. 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. The developed algorithm constructs the finite and complete prefix of the unfolding of the unbounded hybrid Petri net. In the future we plan to develop algorithms for analysing properties of the hybrid Petri nets from the unfolding.
Klíčová slova
Hybrid Petri Nets, unfoldings, complete finite prefix.
Autoři
NOVOSAD, P.; ČEŠKA, M.
Rok RIV
2013
Vydáno
1. 2. 2013
Nakladatel
The Universidad de Las Palmas de Gran Canaria
Místo
Universidad de Las Palmas de Gran Canaria
ISBN
84-695-6971-6
Kniha
Proc. of Computer Aided System Theory 2013
Strany od
244
Strany do
245
Strany počet
2
BibTex
@inproceedings{BUT103432, author="Petr {Novosad} and Milan {Češka}", title="Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets", booktitle="Proc. of Computer Aided System Theory 2013", year="2013", pages="244--245", publisher="The Universidad de Las Palmas de Gran Canaria", address="Universidad de Las Palmas de Gran Canaria", isbn="84-695-6971-6" }