Result Details
Algorithms for Computing Coverability Graphs for Hybrid Petri Nets
Češka Milan, prof. RNDr., CSc., DITS (FIT)
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.
Hybrid Petri Net, Coverability Graph, Algorithm.
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.
@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"
}
Integrated approach to education of PhD students in the area of parallel and distributed systems, GACR, Doktorské granty, GD102/05/H050, start: 2005-01-01, end: 2008-12-31, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running