Faculty of Information Technology, BUT

Publication Details

Algorithms for Computing Coverability Graphs for Hybrid Petri Nets

NOVOSAD Petr and ČEŠKA Milan. Algorithms for Computing Coverability Graphs for Hybrid Petri Nets. In: 4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2008, pp. 177-183. ISBN 978-80-7355-082-0.
Czech title
Algoritmy pro výpočet grafu pokrytí hybridních Petriho sítí
Type
conference paper
Language
english
Authors
Keywords

Hybrid Petri Net, Coverability Graph, Algorithm.

Abstract
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.
Annotation
A useful method for Petri nets analysis is based on a coverability tree or a coverability graph that represents a state space of a system. The paper formalizes the concept of the coverability graphs for autonomous hybrid Petri nets and introduces algorithms for their computing. Algorithms for bounded and unbounded hybrid Petri nets are presented. Every algorithm is accompanied with an example.
Published
2008
Pages
177-183
Proceedings
4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
Conference
MEMICS'08 -- 4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Znojmo, CZ
ISBN
978-80-7355-082-0
Publisher
Masaryk University
Place
Brno, CZ
BibTeX
@INPROCEEDINGS{FITPUB8825,
   author = "Petr Novosad and Milan \v{C}e\v{s}ka",
   title = "Algorithms for Computing Coverability Graphs for Hybrid Petri Nets",
   pages = "177--183",
   booktitle = "4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
   year = 2008,
   location = "Brno, CZ",
   publisher = "Masaryk University",
   ISBN = "978-80-7355-082-0",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/8825"
}
Back to top