Time Petri Nets with Dynamic Firing Dates: Semantics and Applications

We define an extension of time Petri nets such that the time at which a transition can fire, also called its firing date, may be dynamically updated. Our extension provides two mechanisms for updating the timing constraints of a net. First, we propose to change the static time interval of a transition each time it is newly enabled; in this case the new time interval is given as a function of the current marking. Next, we allow to update the firing date of a transition when it is persistent, that is when a concurrent transition fires. We show how to carry the widely used state class abstraction to this new kind of time Petri nets and define a class of nets for which the abstraction is exact. We show the usefulness of our approach with two applications: first for scheduling preemptive task, as a poor man’s substitute for stopwatch, then to model hybrid systems with non trivial continuous behavior.

[1]  Mamoun Filali,et al.  Spécification et vérification d'un ordonnanceur en B via les automates temporisés , 2008, Obj. Logiciel Base données Réseaux.

[2]  Leo Joskowicz,et al.  Solving Systems of Difference Constraints Incrementally , 1999, Algorithmica.

[3]  Junehwa Song,et al.  Solving Difference Constraints Incrementally , 1995 .

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

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

[6]  Frédéric Boniol,et al.  The Landing Gear System Case Study , 2014, ABZ.

[7]  Patricia Bouyer,et al.  Updatable timed automata , 2004, Theor. Comput. Sci..

[8]  Serge Haddad,et al.  Comparison of the Expressiveness of Timed Automata and Time Petri Nets , 2005, FORMATS.

[9]  Klaus-Dieter Schewe,et al.  ABZ 2014: The Landing Gear Case Study , 2014, Communications in Computer and Information Science.

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

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

[12]  Conrado Daws,et al.  Two examples of verification of multirate timed automata with Kronos , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

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

[14]  François E. Cellier,et al.  Quantized State System Simulation , 2008 .

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

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

[17]  Laura Carnevali,et al.  Using Stochastic State Classes in Quantitative Evaluation of Dense-Time Reactive Systems , 2009, IEEE Transactions on Software Engineering.

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

[19]  David J. Murray-Smith,et al.  Continuous System Simulation , 1994 .