State Space Computation and Analysis of Time Petri Nets

Details State Space Computation and Analysis of Time Petri Nets State Space Computation and Analysis of Time Petri Nets

2005-05-10

arxiv.org/abs/cs/0505023v1

Computer Science

Logic in Computer Science

21 pages

Scientific paper

The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove the algorithm to be exact with respect to the reachability problem. Furthermore, we propose a translation of the computed state space into a Timed Automaton, proved to be timed bisimilar to the original Time Petri Net. As the method produce a single Timed Automaton, syntactical clocks reduction methods (Daws and Yovine for instance) may be applied to produce an automaton with fewer clocks. Then, our method allows to model-check TTPN by the use of efficient Timed Automata tools. To appear in Theory and Practice of Logic Programming (TPLP).

Affiliated with

Also associated with

No associations

Rating

State Space Computation and Analysis of Time Petri Nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with State Space Computation and Analysis of Time Petri Nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State Space Computation and Analysis of Time Petri Nets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-312610