Recursive Nested Petri Nets: Analysis of Semantic Properties and Expessibility

Authors:
I. A. Lomazova
Affiliations:
Program Systems Institute, Russian Academy of Sciences, Pereslavl'-Zalesskii, 152140 Russia irina@univ.botik.ru
Venue:
Programming and Computing Software
Year:
2001

Citing 4
Cited 0

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
Principles of High-Level Net Theory

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Structured Nets

Proceedings on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recursive nested Petri nets may contain marked nets, including their own copies, as their tokens. It is proved that the termination problem is decidable for recursive nested nets with autonomous elements. The expessibility of such nets is compared with other extensions of the Petri net formalism.