Computation of the Reachability Graph of untimed Hybrid Petri nets
Untimed hybrid Petri nets are a formalism for the analysis of dynamical systems, which combines discrete and continuous behaviour. The study of its reachability is interesting for analysis purposes, such as the study of behavioural properties. A method to compute its reachability graph and reachability space is proposed here.
2007 ◽
Vol 14
(3)
◽
pp. 393-398
◽
Keyword(s):