Behaviour of elementary net systems
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Axiomatizing net computations and processes
Proceedings of the Fourth Annual Symposium on Logic in computer science
Information and Computation
Branching processes of Petri nets
Acta Informatica
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
On the semantics of place/transition Petri nets
Mathematical Structures in Computer Science
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Mobile Object-Net Systems and their Processes
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Behaviour and Instantiation of High-Level Petri Net Processes
Fundamenta Informaticae
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
High-level nets with nets and rules as tokens
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
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
Factorization properties of symbolic unfoldings of colored petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Hi-index | 0.00 |
Mobile ad-hoc networks (manets) are networks of mobile devices that communicate with each other via wireless links without relying on an underlying infrastructure. To model workflows in manets adequately a formal technique is given by algebraic higher-order nets. For this modeling technique we here present a high-level net process semantics and results concerning composition and independence. Based on the notion of processes for low-level Petri nets we analyse in this paper high-level net processes defining the non-sequential behaviour of high-level nets. In contrast to taking low-level processes of the well known flattening construction for high-level nets our concept of high-level net processes preserves the high-level structure. The main results are the composition, equivalence and independence of high-level net processes under suitable conditions. Independence means that they can be composed in any order leading to equivalent high-level net processes which especially have the same input/output behaviour. All concepts and results are explained with a running example of a mobile ad-hoc network in the area of a university campus.