loading...
Non-reachability in Petri Nets with Delaying Places
Monterey, CA September 11-September 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MASCOTS.2006.3314th IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Matthias Werner, TU Berlin, Germany
Gero Muhl, TU Berlin, Germany
The correctness of systems is frequently proved by demonstrating the non-reachability of certain (incorrect) states with the help of formal frameworks, e.g., Petri nets. Especially for real-time systems, the timely behavior has to be considered. Thus, there exist several extensions that allow the modeling of time in Petri nets. Non-reachability proofs in time-dependent Petri nets are usually done by proving the non-reachability within the time-less skeleton. However, in many cases this approach fails to prove non-reachability, since the skeleton can reach more markings than the timedependent Petri net.

In this paper, we introduce a state equation for a class of time-augmented Petri nets and demonstrate in an example application how this state equation can be used to prove non-reachability within the actual timedependent net.

Citation:
Matthias Werner, Gero Muhl, "Non-reachability in Petri Nets with Delaying Places," mascots, pp.401-412, 14th IEEE International Symposium on Modeling, Analysis, and Simulation, 2006
Usage of this product signifies your acceptance of the Terms of Use.