Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication

DOI10.1007/978-3-642-02424-5_6zbMath1242.68185OpenAlexW2161984463WikidataQ57831229 ScholiaQ57831229MaRDI QIDQ3636840

David de Frutos-Escrig, Fernando Rosa-Velardo

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02424-5_6

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of mobile processes. I
• Mobile ambients
• Algorithmic analysis of programs with well quasi-ordered domains.
• Verifying programs with unreliable channels
• Recursive Petri nets
• On the Expressiveness of Mobile Synchronizing Petri Nets
• Comparing the Expressive Power of Well-Structured Transition Systems
• Well-structured transition systems everywhere!

This page was built for publication: Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication