Information and Computation
A linear logic view of object petri nets
Fundamenta Informaticae - Special issue on Petri nets
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)
Well-structured transition systems everywhere!
Theoretical Computer Science
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
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
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)
Modelling mobility and mobile agents using nets within nets
ICATPN'03 Proceedings of the 24th 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)
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Complexity results for elementary hornets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
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 work we present object net systems, i.e. Petri nets with nets as token objects, which are equipped with channels that allow to transfer net-tokens in the vertical dimension of the nested marking. These channels are a modelling element powerful enough to describe a direct simulation of counter programs which shows that typical net problems like boundedness, coverability, and reachability are undecidable.