Publication Details
Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets
Hybrid Petri Nets, unfoldings, complete finite prefix.
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.
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.
@INPROCEEDINGS{FITPUB10357, author = "Petr Novosad and Milan \v{C}e\v{s}ka", title = "Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets", pages = "428--435", booktitle = "Computer Aided System Theory -EUROCAST 2013 - revised selected papers", series = "Lecture Notes in Computer Science", year = 2013, location = "Ber\'{i}n, DE", publisher = "Springer Verlag", ISBN = "978-3-642-53855-1", language = "english", url = "https://www.fit.vut.cz/research/publication/10357" }