Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets

Time Petri nets have proved their interest in modeling real-time concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a (symbolic and global) state graph, computable from a bounded net. An alternative is to consider a “partial order” semantics given in term of processes, which keep explicit the notions of causality and concurrency without computing arbitrary interleavings. In ordinary place/transition bounded nets, it has been shown for many years that the whole set of processes can be finitely represented by a prefix of what is called the “unfolding”. This paper defines such a prefix for safe time Petri nets. It is based on a symbolic unfolding of the net, using a notion of “partial state”.

[1]  A. Semenov,et al.  Verification of asynchronous circuits using time Petri net unfolding , 1996, 33rd Design Automation Conference Proceedings, 1996.

[2]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[3]  David de Frutos-Escrig,et al.  Formal Techniques for Networked and Distributed Systems – FORTE 2004 , 2004, Lecture Notes in Computer Science.

[4]  Wojciech Penczek,et al.  Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets , 2001, ICATPN.

[5]  Gianfranco Balbo,et al.  Application and Theory of Petri Nets 1997 , 1997 .

[6]  Eike Best.  Structure Theory of Petri Nets: the Free Choice Hiatus , 1986 .

[7]  Chris J. Myers,et al.  Partial Order Reduction for Timed Circuit Verification Based on Level Oriented Model , 2003 .

[8]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[9]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[10]  Thomas Chatain,et al.  Symbolic Diagnosis of Partially Observable Concurrent Systems , 2004, FORTE.

[11]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[12]  Hans Fleischhack,et al.  Model Checking of Time Petri Nets Based on Partial Order Semantics , 1999, CONCUR.

[13]  Johan Lilius,et al.  Time Processes for Time Petri-Nets , 1997, ICATPN.

[14]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.

[15]  Alexandre Yakovlev,et al.  Unfolding and Finite Prefix for Nets with Read Arcs , 1998, CONCUR.

[16]  Hans Fleischhack,et al.  Computing a Finite Prefix of a Time Petri Net , 2002, ICATPN.

[17]  Ugo Montanari,et al.  Contextual Petri Nets, Asymmetric Event Structures, and Processes , 2001, Inf. Comput..

[18]  Thomas Chatain,et al.  Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets , 2005, FORMATS.

[19]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..

[20]  Joost Engelfriet,et al.  Branching processes of Petri nets , 1991, Acta Informatica.

[21]  Wolfgang Reisig,et al.  Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II , 1986 .

[22]  Javier Esparza,et al.  Application and Theory of Petri Nets 2002 , 2002, Lecture Notes in Computer Science.

[23]  Robin Milner.  The Flux of Interaction , 2001, ICATPN.

[24]  Johan Lilius,et al.  Efficient State Space Search for Time Petri Nets , 1998, MFCS Workshop on Concurrency.