Forward analysis for Petri nets with name creation

DOI10.1007/978-3-642-13675-7_12MaRDI QIDQ3569867zbMATH OpenOpenAlexWikidataFDO

Authors Fernando Rosa-Velardo, David de Frutos Escrig

Publication date 22 June 2010

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-13675-7_12

Mathematics Subject Classification ID

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

Recommendations

• Accelerations for the coverability set of Petri nets with names
• \(\omega \)-Petri nets
• Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
• Decidability problems in Petri nets with names and replication
• Decidability and complexity of Petri nets with unordered data

Cited in

(6)

• Name Creation vs. Replication in Petri Net Systems
• Petri nets with name creation for transient secure association
• Decidability and complexity of Petri nets with unordered data
• Accelerations for the coverability set of Petri nets with names
• scientific article; zbMATH DE number 5506900 (Why is no real title available?)
• Correctness Notions for Petri Nets with Identifiers

This page was built for publication: Forward analysis for Petri nets with name creation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569867)