Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets

The main problem of verification techniques based on exploration of (reachable) state space is the state explosion problem. In timed models, abstract states reached by different interleavings of the same set of transitions are, in general, different and their union is not necessarily an abstract state. To attenuate this state explosion, it would be interesting to reduce the redundancy caused by the interleaving semantics by agglomerating all these abstract states whenever their union is an abstract state. This article considers the time Petri net model and establishes some sufficient conditions that ensure that this union is an abstract state. In addition, it proposes a procedure to compute this union without computing beforehand intermediate abstract states. Finally, it shows how to use this result to improve the reachability analysis.

[1]  Hanifa Boucheneb,et al.  Improving state class constructions for CTL* model checking of time Petri nets , 2008, International Journal on Software Tools for Technology Transfer.

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

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

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

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

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

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

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

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

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

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

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

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

[14]  Hanifa Boucheneb,et al.  TCTL Model Checking of Time Petri Nets , 2009, J. Log. Comput..

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

[16]  Oded Maler,et al.  On Interleaving in Timed Automata , 2006, CONCUR.

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

[18]  Kamel Barkaoui,et al.  On combining the ready sets with the covering steps methods , 2014, Int. J. Crit. Comput. Based Syst..

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

[20]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[21]  Kim G. Larsen,et al.  Lower and upper bounds in zone-based abstractions of timed automata , 2004, International Journal on Software Tools for Technology Transfer.