A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Properties of Distributed Timed-Arc Petri Nets
[chapter]
2001
Lecture Notes in Computer Science
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. Definition 1 (Distributed timed-arc Petri
doi:10.1007/3-540-45294-x_24
fatcat:227gspb5mbbljaxbrxnma6vuvy