Dynamic Recursive Petri Nets

DOI10.1007/978-3-030-51831-8_17zbMath1503.68192OpenAlexW3012172783MaRDI QIDQ5100760

Serge Haddad, Igor Khmelnitsky

Publication date: 1 September 2022

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51831-8_17

zbMATH Keywords

decidabilityexpressivenesscoverabilityrecursive Petri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• A well-structured framework for analysing Petri net extensions
• Process rewrite systems.
• Recursive Petri nets
• On Functions Weakly Computable by Petri Nets and Vector Addition Systems
• Coverability, Termination, and Finiteness in Recursive Petri Nets
• The Logical View on Continuous Petri Nets
• Well-structured transition systems everywhere!
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic Recursive Petri Nets