Properties of Distributed Timed-Arc Petri Nets

In [12] we started a research on a distributed-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. This formalism enables to model e.g. hardware architectures like GALS. We give a formal definition of process semantics for our model and investigate several properties of local versus global timing: expressiveness, reachability and coverability.

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

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

[3]  Scott Hauck,et al.  Asynchronous design methodologies: an overview , 1995, Proc. IEEE.

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

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

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

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

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

[9]  Jirí Srba,et al.  Towards a Notion of Distributed Time for Petri Nets , 2001, ICATPN.

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

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

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

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

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

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

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