Properties of Distributed Timed-Arc Petri Nets [chapter]

Mogens Nielsen, Vladimiro Sassone, Jiří Srba
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
more » ... . A place/transition Petri net (PT) is a tuple (P, T, F ), where P is a finite set of places, T is a finite set of transitions such that T ∩ P = ∅, and F ⊆ (P × T ) ∪ (T × P ) is a flow relation. A distributed timed-arc Petri net (DTAPN) is a tuple N = (P, T, F, c, E, D), where (P, T, F ) is a Petri net and: -E ⊆ P × P is an equivalence relation on places (synchronisation relation), and use B(X) to denote the set of all finite multisets on a set X. In what follows, we assume that • t = ∅ for every t ∈ T . A marked PT net is a net (P, T, F ) together with an initial marking M ∈ B(P ). A marking of a DTAPN (P, T, F, c, E, D) is a function M : P → B(D). A
doi:10.1007/3-540-45294-x_24 fatcat:227gspb5mbbljaxbrxnma6vuvy