Information and Computation
Petri nets and algebraic specifications
Theoretical Computer Science
A calculus of mobile processes, II
Information and Computation
Zero-safe nets: comparing the collective and individual token approaches
Information and Computation - Special issue on EXPRESS 1997
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Petri net algebra
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Mobility Types for Mobile Ambients
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
PN2: An Elementary Model for Design and Analysis of Multi-agent Systems
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Petri Nets as Token Objects: An Introduction to Elementary Object Nets
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Theoretical Aspects of Recursive Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Modelling the Structure and Behaviour of Petri Net Agents
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Concurrency in mobile object net systems
Fundamenta Informaticae - Concurrency specification and programming
Modelling Global and Local Name Spaces for Mobile Agents Using Object Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Checking Properties of Adaptive Workflow Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
The Reachability Problem for Object Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Modelling mobility and mobile agents using nets within nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Pattern based workflow design using reference nets
BPM'03 Proceedings of the 2003 international conference on Business process management
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Nested nets for adaptive systems
ICATPN'06 Proceedings of the 27th 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
Modelling mobility with petri hypernets
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Boundedness of adaptive nets is decidable
Information Processing Letters
Providing an agent flavored integration for workflow management
Transactions on Petri Nets and Other Models of Concurrency V
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
P- and t-systems in the nets-within-nets-formalism
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Complexity results for elementary hornets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Cellular Resource-Driven Automata
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
On Compositionality of Boundedness and Liveness for Nested Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Conservative Elementary Object Systems
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Defining Multi-Party Compromises using Unfoldings of Workflow Nets
Fundamenta Informaticae - Concurrency, Specification and Programming
On the Complexity of the Reachability Problem for Safe, Elementary Hornets
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
| Hi-index | 0.00 |
In this contribution we propose an algebraic extension of object nets. Object nets, also known as nets within nets , allow nets itself as tokens. The algebraic structure introduced here refers to the topology of these net-tokens, i.e. we have operators which compose nets. Object nets that use net operations in arc expression are called Higher Order Recursive Nets , or short: Hornets . The operations on nets allow to modify the structure of net-tokens at run-time. We apply this construct to the workflow management domain. We propose a simple Hornet model of a distributed workflow management system . This system consists of a network of workflow management agents. The agents cooperatively transfer workflows over the network for distributed execution, monitor their processes, and reorganise the workflow repository to improve e.g. the system's performance.