The Right Timing: Reflections on the Modeling and Analysis of Time

In this paper we discuss several approaches to time in Petri nets. If time is considered for performance analysis, probability distributions for choices should be included into the model and thus we need Petri nets with time and stochastics. In literature, most attention is paid to models where the time is expressed by delaying transitions and for the stochastic case to continuous time models with exponential enabling distributions, known by its software tools as GSPN. Here we focus on discrete models where the time is expressed by delaying tokens and the probability distributions are discrete, because this model class has some advantages. We show how model checking methods can be applied for the non-stochastic case. For the stochastic case we show how Markov techniques can be used. We also consider structural analysis techniques, which do not need the state space.

[1]  Marc Boyer,et al.  On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets , 2008, Fundam. Informaticae.

[2]  van Km Kees Hee,et al.  Analysis of discrete‐time stochastic petri nets , 2000 .

[3]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[4]  Manuel Silva Suárez,et al.  Continuous Petri Nets: Expressive Power and Decidability Issues , 2010, Int. J. Found. Comput. Sci..

[5]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[6]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[7]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[8]  Wil M. P. van der Aalst Interval Timed Coloured Petri Nets and their Analysis , 1993, Application and Theory of Petri Nets.

[9]  Hanifa Boucheneb,et al.  Occurrence Graphs for Interval Timed Coloured Nets , 1994, Application and Theory of Petri Nets.

[10]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[11]  Carlo Ghezzi,et al.  A Unified High-Level Petri Net Formalism for Time-Critical Systems , 1991, IEEE Trans. Software Eng..

[12]  Patricia Bouyer,et al.  Undecidability Results for Timed Automata with Silent Transitions , 2009, Fundam. Informaticae.

[13]  Kees M. van Hee,et al.  Executable Specifications for Distributed Information Systems , 1989, International Symposium on Combinatorial Optimization.

[14]  Hanifa Boucheneb,et al.  Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties , 2008, Formal Aspects of Computing.

[15]  Lars Michael Kristensen,et al.  Condensed State Spaces for Timed Petri Nets , 2001, ICATPN.

[16]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[17]  Peter H. Starke Some properties of timed nets under the earliest firing rule , 1988, European Workshop on Applications and Theory in Petri Nets.

[18]  Didier Lime,et al.  Model Checking of Time Petri Nets Using the State Class Timed Automaton , 2006, Discret. Event Dyn. Syst..

[19]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

[20]  Michal Knapik,et al.  Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics , 2010, Fundam. Informaticae.

[21]  Grzegorz Rozenberg Advances in Petri Nets 1989 , 1988, Lecture Notes in Computer Science.

[22]  C. V. Ramamoorthy,et al.  Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets , 1980, IEEE Transactions on Software Engineering.

[23]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[24]  David de Frutos-Escrig,et al.  On non-decidability of reachability for timed-arc Petri nets , 1999, PNPM.

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

[26]  Matthias Jantzen Language theory of Petri nets , 1986 .

[27]  Sheldon M. Ross Introduction to Probability Models. , 1995 .

[28]  Sheldon M. Ross,et al.  Introduction to Probability Models, Eighth Edition , 1972 .

[29]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[30]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1985 , 1985, Lecture Notes in Computer Science.

[31]  Serge Haddad,et al.  Sub-stochastic matrix analysis for bounds computation - Theoretical results , 2007, Eur. J. Oper. Res..

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

[33]  Andrea Maggiolo-Schettini,et al.  Time-Based Expressivity of Time Petri Nets for System Specification , 1999, Theor. Comput. Sci..

[34]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[35]  Joseph Sifakis,et al.  Use of Petri nets for performance evaluation , 1977, Acta Cybern..

[36]  Olivier H. Roux,et al.  Structural Translation from Time Petri Nets to Timed Automata , 2005, Electron. Notes Theor. Comput. Sci..

[37]  Robin Milner The Flux of Interaction , 2001, ICATPN.

[38]  Thomas A. Henzinger,et al.  Hybrid Systems III , 1995, Lecture Notes in Computer Science.

[39]  Robert Valette,et al.  Application and Theory of Petri Nets 1997 , 1997, Lecture Notes in Computer Science.

[40]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[41]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[42]  Kurt Jensen,et al.  An Introduction to the Theoretical Aspects of Coloured Petri Nets , 1993, REX School/Symposium.

[43]  van Km Kees Hee,et al.  Discrete timed Petri nets , 2013 .