On combining the ready sets with the covering steps methods

We consider here time Petri nets and the covering steps graph technique proposed by Vernadat et al. for untimed Petri nets. In this technique, some transitions are put together to be fired in a single transition step. This paper investigates how this technique can be extended to be applied to time Petri nets. It establishes some sufficient conditions useful to construct covering steps graphs preserving LTL

[1]  Doron A. Peled,et al.  Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator , 1997, Inf. Process. Lett..

[2]  Hanifa Boucheneb,et al.  CTL* model checking for time Petri nets , 2006, Theor. Comput. Sci..

[3]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

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

[5]  Stefan Edelkamp,et al.  Partial-order reduction and trail improvement in directed model checking , 2004, International Journal on Software Tools for Technology Transfer.

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

[7]  Hanifa Boucheneb,et al.  A More Efficient Time Petri Net State Space Abstraction Useful to Model Checking Timed Linear Properties , 2008, Fundam. Informaticae.

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

[9]  Chris J. Myers,et al.  Partial Order Reduction for Detecting Safety and Timing Failures of Timed Circuits , 2005, IEICE Trans. Inf. Syst..

[10]  Ruurd Kuiper,et al.  Partial-order Reduction Techniques for Real-time Model Checking , 1998, Formal Aspects of Computing.

[11]  Olivier H. Roux,et al.  Using Zone Graph Method for Computing the State Space of a Time Petri Net , 2003, FORMATS.

[12]  François Vernadat,et al.  Covering Step Graph , 1996, Application and Theory of Petri Nets.

[13]  Johan Bengtsson,et al.  Clocks, DBMS and States in Timed Systems , 2002 .

[14]  Wojciech Penczek,et al.  Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata , 2004, ICATPN.

[15]  Lars Michael Kristensen,et al.  Finding Stubborn Sets of Coloured Petri Nets Without Unfolding , 1998, ICATPN.

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

[17]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[18]  Doron A. Peled,et al.  All from One, One for All: on Model Checking Using Representatives , 1993, CAV.

[19]  François Vernadat,et al.  On Combining the Persistent Sets Method with the Covering Steps Graph Method , 2002, FORTE.

[20]  Kamel Barkaoui,et al.  Covering Steps Graphs of Time Petri Nets , 2009, INFINITY.