Time distance based computation of the state space of preemptive real time systems

We explore in this paper a novel approach that builds an overapproximation of the state space of preemptive real time systems. Our graph construction extends the expression of a class to the time distance system that encodes the quantitative properties of past fired subsequences. This makes it possible to restore relevant time information that is used to tighten still more the DBM overapproximation of reachable classes. We succeed thereby to build efficiently tighter approximated graphs which are more appropriate to restore the quantitative properties of the model. The simulation results show that the computed graphs are of the same size as the exact graphs while improving by far the times needed for their computation.

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

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

[3]  Didier Lime,et al.  Symbolic unfolding of parametric stopwatch Petri nets , 2010, Formal Methods in System Design.

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

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

[6]  Wiwat Vatanawood,et al.  Simulation of Preemptive Scheduling of the Independent Tasks Using Timed Automata , 2021, ICSCA.

[7]  Franco Cicirelli,et al.  Development of a Schedulability Analysis Framework Based on pTPN and UPPAAL with Stopwatches , 2012, 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications.

[8]  Nadjib Badache,et al.  Towards Building the State Class Graph of the TSPN Model , 2008, Fundam. Informaticae.

[9]  Morgan Magnin,et al.  Expressiveness of Petri Nets with Stopwatches. Dense-time Part , 2009, Fundam. Informaticae.

[10]  Hanifa Boucheneb,et al.  Towards a simplified building of time Petri Nets reachability graph , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

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

[12]  A. B. Glonina,et al.  On the Correctness of Real-Time Modular Computer Systems Modeling with Stopwatch Automata Networks , 2019, Automatic Control and Computer Sciences.

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

[14]  David Avis,et al.  On canonical representations of convex polyhedra , 2002 .

[15]  Nadjib Badache,et al.  Synchronized Transitions Preemptive Time Petri Nets: A new model towards specifying multimedia requirements , 2006, IEEE International Conference on Computer Systems and Applications, 2006..

[16]  Abdelli Abdelkrim.  Efficient computation of quantitative properties of real-time preemptive systems , 2012, Int. J. Crit. Comput. Based Syst..

[17]  Abdelli Abdelkrim,et al.  Improving the Construction of the DBM Over Approximation of the State Space of Real-time Preemptive Systems , 2012, Acta Cybern..

[18]  Didier Lime,et al.  Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches , 2009, TACAS.

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

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

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