Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Branching processes of Petri nets
Acta Informatica
A trace semantics for Petri nets
Information and Computation
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Trapping mutual exclusion in the box calculus
Theoretical Computer Science - Special volume on Petri nets
Information and Computation
Process semantics for place/transition nets with inhibitor and read arcs
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Partial order semantics and read arcs
Theoretical Computer Science
Theoretical Computer Science - Natural computing
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Modelling and Analysis of Distributed Software Using GSPNs
Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Protocol Specification Using P-Graphs, a Technique Based on Coloured Petri Nets
Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Process semantics of general inhibitor nets
Information and Computation
Synchrony and asynchrony in membrane systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Infinite process semantics of inhibitor nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
| Hi-index | 0.00 |
We are concerned with causality semantics in the executions of Petri nets with range arcs. Range arcs combine (and subsume) the distinctive features of inhibitor and activator arcs, and each such arc provides a means of specifying a range (a finite or infinite interval of non-negative integers) for the number of tokens in a place which makes enabling of a given transition possible. We demonstrate that the existing treatment of causality developed for Petri nets with inhibitor arcs based on structures generalising partial orders can also be applied to nets with range arcs.