Publication Details

Algorithms for Computing Coverability Graphs for Hybrid Petri Nets

NOVOSAD, P.; ČEŠKA, M. Algorithms for Computing Coverability Graphs for Hybrid Petri Nets. 4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2008. p. 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
Novosad Petr, Ing.
Češka Milan, prof. RNDr., CSc.
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
ISBN
978-80-7355-082-0
Publisher
Masaryk University
Place
Brno
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"
}
Back to top