Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Information and Computation
Theoretical Computer Science
On the nature of events: another perspective in concurrency
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Information and Computation
On causality semantics of nets with priorities
Fundamenta Informaticae
Contextual Petri nets, asymmetric event structures, and processes
Information and Computation
Partial order semantics and read arcs
Theoretical Computer Science
Petri Nets over Partial Algebra
Unifying Petri Nets, Advances in Petri Nets
An axiomatization of the category of Petri net computations
Mathematical Structures in Computer Science
Process semantics of Petri nets over partial algebra
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Process semantics of P/T-nets with inhibitor arcs
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Process semantics of general inhibitor nets
Information and Computation
Semantics of petri nets: a comparison
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Hi-index | 0.00 |
In the paper we extend the algebraic description of Petri nets based on rewriting logic by introducing a partial synchronous operation in order to distinguish between synchronous and concurrent occurrences of transitions. In such an extension one first needs to generate steps of transitions using a partial operation of synchronous composition and then to use these steps to generate process terms using partial operations of concurrent and sequential composition. Further, we define which steps are true synchronous. In terms of causal relationships, such an extension corresponds to the approach described in [6,7,9], where two kinds of causalities are defined, first saying (as usual) which transitions cannot occur earlier than others, while the second indicating which transitions cannot occur later than others. We illustrate this claim by proving a one-to-one correspondence between such extended algebraic semantics of elementary nets with inhibitor arcs and causal semantics of elementary nets with inhibitor arcs presented in [7].