Reduction and covering of infinite reachability trees
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)
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Fundamental Structures in Well-Structured Infinite Transition Systems
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Proceedings on Mathematical Foundations of Computer Science
Relating Different Semantics for Object Petri Nets
Relating Different Semantics for Object Petri Nets
Reachability in Petri Nets with Inhibitor Arcs
Electronic Notes in Theoretical Computer Science (ENTCS)
Code mobility modeling: a temporal labeled reconfigurable nets
Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications
Checking Properties of Adaptive Workflow Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
ECA-Rule Visual Programming for Ubiquitous and Nomadic Computing
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification
Electronic Notes in Theoretical Computer Science (ENTCS)
Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Nested Petri nets for adaptive process modeling
Pillars of computer science
Ubiquitous systems and petri nets
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
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
Symbolic semantics for the verification of security properties of mobile petri nets
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
On model checking data-independent systems with arrays with whole-array operations
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Hi-index | 0.00 |
Nested Petri nets (NP-nets) is a formalism for modeling hierarchical multi-agent systems. Tokens in nested Petri nets are elements represented by nets themselves. The paper continues investigating semantic properties of NP-nets, started in [10], where two-level NP-nets were studied. Here we consider multi-level and recursive NP-nets, for which decidability of termination and some other properties are proved. A comparison of NP-nets with other Petri net models is given.