A Much Compact Abstraction of the State Space of Real time Preemptive Systems

Preemptive Systems are systems whose tasks are timely constrained and which can be suspended for a while and resumed afterwards. In order to check for their reliability, formal methods are applied to model and to analyze their behaviors. This is achieved by computing their state spaces that can be abstracted and encoded as graphs. We present in this paper an algorithm allowing an efficient computation of a DBM over-approximation of the state space of preemptive systems modeled by using Time Petri Nets with inhibitor arcs. For this effect, each class of this graph is expressed as a pair (M, D), where M is a marking and D is the system of DBM inequalities. In [1] we have defined an algorithm to compute the system D straightforwardly in its normal form, without requiring computing the intermediary polyhedron. We explore for this abstraction a suitable equivalence relation that contracts yet more the graphs. Experimental results comparing our algorithm with other approaches are reported.

[1]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

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

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

[4]  Kim G. Larsen,et al.  The Impressive Power of Stopwatches , 2000, CONCUR.

[5]  Didier Lime,et al.  An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches , 2006, SoftMC@CAV.

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

[7]  Abdelli Abdelkrim.  Optimisation de la construction d'une approximation de l'espace d'état des systèmes préemptifs , 2009, Tech. Sci. Informatiques.

[8]  Didier Lime,et al.  Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation , 2004, ICATPN.

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

[10]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[11]  David L. Dill,et al.  Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.

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

[13]  Abdelli Abdelkrim,et al.  Efficient computation of state space over approximation of preemptive real time systems , 2008, 2008 IEEE/ACS International Conference on Computer Systems and Applications.