Abstract State Spaces for Time Petri Nets Analysis

The paper is organized as follows. Section 2 reviews the terminology of time Petri nets and the definitions of their state spaces. The classical "state classes" construction, preserving markings and LTL properties, is explained in section 3, and its properties discussed. Section 4 explains the richer "strong state classes" abstraction, that allows in addition to decide state reachability properties. Section 5 discusses preservation of branching properties and explains the "atomic state classes" construction. Finally, section 7 discusses a number of related issues and recent results, including extensions of these methods to handle enriched classes of time Petri nets.

[1]  Didier Lime,et al.  Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches , 2007, Discret. Event Dyn. Syst..

[2]  François Vernadat,et al.  Model Checking Bounded Prioritized Time Petri Nets , 2007, ATVA.

[3]  Rajeev Alur,et al.  Minimization of Timed Transition Systems , 1992, CONCUR.

[4]  Philip Meir Merlin,et al.  A study of the recoverability of computing systems. , 1974 .

[5]  Hanifa Boucheneb,et al.  Analyse des réseaux temporels. Calcul des classes en O(n2) et des temps de chemin en O(m x n) , 2003, Tech. Sci. Informatiques.

[6]  Enrico Vicario,et al.  Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets , 1995, IEEE Trans. Software Eng..

[7]  Tomohiro Yoneda,et al.  CTL Model Checking of Time Petri Nets Using Geometric Regions , 1998 .

[8]  Didier Lime,et al.  Expressiveness and analysis of scheduling extended time Petri nets , 2003 .

[9]  Chris J. Myers,et al.  Automatic Verification of Timed Circuits , 1994, CAV.

[10]  Bernard Berthomieu,et al.  An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

[11]  F. Vernadat,et al.  The tool TINA – Construction of abstract state spaces for petri nets and time petri nets , 2004 .

[12]  Enrico Vicario,et al.  ORIS: a tool for state-space analysis of real-time preemptive systems , 2004 .

[13]  Tomohiro Yoneda,et al.  Efficient Verification of Parallel Real–Time Systems , 1993, Formal Methods Syst. Des..

[14]  Olivier H. Roux,et al.  Structural translation from Time Petri Nets to Timed Automata , 2005, J. Syst. Softw..

[15]  François Vernadat,et al.  State Class Constructions for Branching Analysis of Time Petri Nets , 2003, TACAS.

[16]  Enrico Vicario,et al.  Timed state space analysis of real-time preemptive systems , 2004, IEEE Transactions on Software Engineering.

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

[18]  Louchka Popova-Zeugmann,et al.  On Time Petri Nets , 1991, J. Inf. Process. Cybern..

[19]  Didier Lime,et al.  Romeo: A Tool for Analyzing Time Petri Nets , 2005, CAV.

[20]  François Vernadat,et al.  Bridging the Gap Between Timed Automata and Bounded Time Petri Nets , 2006, FORMATS.

[21]  Irina Virbitskaite,et al.  A Partial Order Method for the Verification of Time Petri Nets , 1999, FCT.

[22]  Neil D. Jones,et al.  Complexity of Some Problems in Petri Nets , 1977, Theor. Comput. Sci..

[23]  Enrico Vicario,et al.  Static Analysis and Dynamic Steering of Time-Dependent Systems , 2001, IEEE Trans. Software Eng..

[24]  Louchka Popova-Zeugmann,et al.  Analyzing Paths in Time Petri Nets , 1999, Fundam. Informaticae.

[25]  Wojciech Penczek,et al.  Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach , 2006, Studies in Computational Intelligence.

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