Time and Petri Nets

At first glance the concepts of time and of Petri nets are quite contrary: while time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and they represent events as concurrent systems. But if we take a closer look at how time and causality are intertwined we realize that there are many possible ways in which time and Petri nets interact. This book takes a closer look at three time-dependent Petri nets: Time Petri nets, Timed Petri nets, and Petri nets with time windows. The author first explains classic Petri nets and their fundamental properties. Then the pivotal contribution of the book is the introduction of different algorithms that allow us to analyze time-dependent Petri nets. For Time Petri nets, the author presents an algorithm that proves the behavioral equivalence of a net where time is designed once with real and once with natural numbers, so we can reduce the state space and consider the integer states exclusively. For Timed Petri nets, the author introduces two time-dependent state equations, providing a sufficient condition for the non-reachability of states, and she also defines a local transformation for converting these nets into Time Petri nets. Finally, she shows that Petri nets with time-windows have the ability to realize every transition sequence fired in the net omitting time restrictions. These classes of time-dependent Petri nets show that time alone does not change the power of a Petri net, in fact time may or may not be used to force firing. For Time Petri nets and Timed Petri nets we can say that they are Turing-powerful, and thus more powerful than classic Petri nets, because there is a compulsion to fire at some point in time. By contrast, Petri nets with time-windows have no compulsion to fire, their expressiveness power is less than that of Turing-machines. This book derives from advanced lectures, and the text is supported throughout withexamples and exercises. It issuitable for graduate courses in computer science, mathematics, engineering, and related disciplines, and as a reference for researchers.

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

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

[3]  Eike Best.  Structure Theory of Petri Nets: the Free Choice Hiatus , 1986 .

[4]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

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

[7]  Alain Finkel,et al.  The Minimal Coverability Graph for Petri Nets , 1991, Applications and Theory of Petri Nets.

[8]  Louchka Popova-Zeugmann,et al.  Petri Nets with Time Windows: A Comparison to Classical Petri Nets , 2009, Fundam. Informaticae.

[9]  W. Penczek.  Partial Order Reductions for Checking Branching Properties of Time Petri Nets ? (extended Abstract -11.09.2000) , 2000 .

[10]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[11]  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.

[12]  Louchka Popova-Zeugmann,et al.  Time-independent Liveness in Time Petri Nets , 2010, Fundam. Informaticae.

[13]  Jiacun Wang,et al.  Timed Petri Nets , 1998, The Kluwer International Series on Discrete Event Dynamic Systems.

[14]  Bernd Walter.  Transaktionsorientierte Recovery-Konzepte für verteilte Datenbanksysteme , 1982 .

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

[16]  Karsten Lemmer.  Diagnose diskret modellierter Systeme mit Petrinetzen , 1995 .

[17]  Louchka Popova-Zeugmann,et al.  On Time Petri Nets , 1991, J. Inf. Process. Cybern..

[18]  Joseph Sifakis.  Performance Evaluation of Systems Using Nets , 1979, Advanced Course: Net Theory and Applications.

[19]  Louchka Popova-Zeugmann,et al.  Automatic composition of timed Petri net specifications for a real-time architecture , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[20]  Nick Roussopoulos,et al.  Timing Requirements for Time-Driven Systems Using Augmented Petri Nets , 1983, IEEE Transactions on Software Engineering.

[21]  C. Petri.  Kommunikation mit Automaten , 1962 .

[22]  Louchka Popova-Zeugmann,et al.  Time Petri Nets for Modelling and Analysis of Biochemical Networks , 2005, Fundam. Informaticae.

[23]  Louchka Popova-Zeugmann,et al.  Quantitative evaluation of time-dependent Petri nets and applications to biochemical networks , 2011, Natural Computing.

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

[25]  Louchka Popova-Zeugmann,et al.  Verification of Non-functional Properties of a Composable Architecture with Petrinets , 2002, Fundam. Informaticae.

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

[27]  Louchka Popova-Zeugmann.  Time Petri nets state space reduction using dynamic programming , 2006 .

[28]  Serge Haddad,et al.  The expressive power of time Petri nets , 2013, Theor. Comput. Sci..

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

[30]  Louchka Popova-Zeugmann.  Petri nets with time restrictions , 1993 .

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

[32]  Wolfgang Reisig,et al.  Understanding Petri Nets Modeling Techniques, Analysis Methods, Case Studies , 2013, Bull. EATCS.

[33]  Jan Richling.  Komponierbarkeit eingebetteter Echtzeitsysteme , 2006 .

[34]  Falko Bause,et al.  Stochastic Petri Nets: An Introduction to the Theory , 2012, PERV.

[35]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[36]  Peter H. Starke,et al.  Analyse von Petri-Netz-Modellen , 1990, Leitfäden und Monographien der Informatik.

[37]  Louchka Popova-Zeugmann,et al.  A Method to Prove Non-Reachability in Priority Duration Petri Nets , 2004, Fundam. Informaticae.

[38]  Olivier H. Roux,et al.  Structural translation from Time Petri Nets to Timed Automata , 2005, J. Syst. Softw..

[39]  Louchka Popova-Zeugmann,et al.  Worst-case Analysis of Concurrent Systems with Duration Interval Petri Nets , 1997 .

[40]  Amir Pnueli,et al.  Marked Directed Graphs , 1971, J. Comput. Syst. Sci..

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

[42]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[43]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[44]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[45]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[46]  Rajeev Motwani,et al.  Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.) , 1990, Internationale Computer-Bibliothek.

[47]  Louchka Popova-Zeugmann,et al.  Analyzing Paths in Time Petri Nets , 1999, Fundam. Informaticae.

[48]  Wojciech Penczek,et al.  Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach , 2006, Studies in Computational Intelligence.

[49]  Louchka Popova-Zeugmann,et al.  Algebraical Characterisation of Interval-Timed Petri Nets with Discrete Delays , 2012, Fundam. Informaticae.

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