Towards a Notion of Distributed Time for Petri Nets

We set the ground for research on a timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. The novelty is that, rather than a single global clock, we use a set of unrelated clocks -- possibly one per place -- allowing a local timing as well as distributed time synchronisation. We give a formal definition of the model and investigate properties of local versus global timing, including decidability issues and notions of processes of the respective models.

[1]  Javier Esparza,et al.  More infinite results , 2001, INFINITY.

[2]  Stavros Tripakis,et al.  Kronos: A Model-Checking Tool for Real-Time Systems , 1998, CAV.

[3]  Hans-Michael Hanisch.  Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control , 1993, Application and Theory of Petri Nets.

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

[5]  Faron Moller,et al.  Infinite Results , 1996, CONCUR.

[6]  Parosh Aziz Abdulla,et al.  Simulation Is Decidable for One-Counter Nets (Extended Abstract) , 1998, CONCUR.

[7]  Jiacun Wang,et al.  Timed Petri Nets: Theory and Application , 1998 .

[8]  Fred B. Schneider,et al.  Putting Time into Proof Outlines , 1991, REX Workshop.

[9]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

[11]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[12]  Tommaso Bolognesi,et al.  From timed Petri nets to timed LOTOS , 1990, PSTV.

[13]  Ernst W. Mayr,et al.  An algorithm for the general Petri net reachability problem , 1981, STOC '81.

[14]  Wolfgang Reisig,et al.  Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[15]  P. Abdulla,et al.  Simulation Is Decidable for One-Counter Nets , 2022 .

[16]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

[17]  Ahmed Bouajjani,et al.  Model Checking Lossy Vector Addition Systems , 1999, STACS.

[18]  Hannu Tenhunen,et al.  Evaluating benefits of Globally Asynchronous Locally Synchronous VLSI Architecture , 1998 .

[19]  Petr Jancar,et al.  Bisimulation Equivalence is Decidable for One-Counter Processes , 1997, ICALP.

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

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

[22]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

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

[24]  V. Valero Ruiz,et al.  On non-decidability of reachability for timed-arc Petri nets , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

[25]  David de Frutos-Escrig,et al.  Decidability of Properties of Timed-Arc Petri Nets , 2000, ICATPN.

[26]  Petr Jancar,et al.  Decidability of a Temporal Logic Problem for Petri Nets , 1990, Theor. Comput. Sci..