Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
NOVOSAD, P. ČEŠKA, M.
Originální název
Algorithms for Computing Coverability Graphs for Hybrid Petri Nets
Typ
článek ve sborníku mimo WoS a Scopus
Jazyk
angličtina
Originální abstrakt
The paper formalizes the concept of the coverability graphs for autonomous hybrid Petri nets and introduces algorithms for their computing. Every algorithm is accompanied with an example. Algorithms for the bounded and unbounded hybrid Petri nets are presented.
Klíčová slova
Hybrid Petri Net, Coverability Graph, Algorithm.
Autoři
NOVOSAD, P.; ČEŠKA, M.
Rok RIV
2008
Vydáno
10. 11. 2008
Nakladatel
Masaryk University
Místo
Brno
ISBN
978-80-7355-082-0
Kniha
4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
Strany od
177
Strany do
183
Strany počet
7
BibTex
@inproceedings{BUT30728, author="Petr {Novosad} and Milan {Češka}", title="Algorithms for Computing Coverability Graphs for Hybrid Petri Nets", booktitle="4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science", year="2008", pages="177--183", publisher="Masaryk University", address="Brno", isbn="978-80-7355-082-0" }