A structure to decide reachability in Petri nets
Theoretical Computer Science
Modelling the Structure and Behaviour of Petri Net Agents
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Some Decidability Results for Nested Petri Nets
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Modelling mobility and mobile agents using nets within nets
ICATPN'03 Proceedings of the 24th 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
Concurrency in Mobile Object Net Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
A Linear Logic View of Object Petri Nets
Fundamenta Informaticae
Complexity results for elementary hornets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Conservative Elementary Object Systems
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
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 article I will prove undecidability results for elementary object net systems (EOS). Object nets are Petri nets which have Petri nets as tokens - an approach which is called the "netswithin-nets" paradigm. EOS are special object net systems which have a two leveled structure.