Petri nets: an introduction
Nonsequential processes
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
A linear logic view of object petri nets
Fundamenta Informaticae - Special issue on Petri nets
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
Concurrency in mobile object net systems
Fundamenta Informaticae - Concurrency specification and programming
Modelling mobility and mobile agents using nets within nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Composition and Independence of High-Level Net Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Independence of net transformations and token firing in reconfigurable place/transition systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Reference and value semantics are equivalent for ordinary object petri nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Hi-index | 0.00 |
The Petri-net-based formalism of mobile object-net systems (Mons) is used to model concurrent systems with dynamically changing environments, such as mobile objects. The tokens in Mons are themselves Petri nets, which gives the formalism an additional (vertical) dimension of nesting. Traditional Petri nets have essentially a horizontal structure, given by the fact that markings are multisets. The question arises, whether Mons can be regarded as a canonical extension of such Petri nets. Due to the nested nature of Mons, the answer is not obvious. We first give the formal definition of Mons and then prove some properties of the formalism, showing that, with respect to interleaving semantics (i.e. firing sequences), Mons can indeed be viewed as a canonical extension of traditional Petri nets. We then define Mons processes, also as a canonical extension of standard Petri net processes.