Name Creation vs. Replication in Petri Net Systems

DOI10.1007/978-3-540-73094-1_24MaRDI QIDQ3612945zbMATH OpenOpenAlexFDO

Authors Fernando Rosa-Velardo, David de Frutos Escrig

Publication date 11 March 2009

Published in Petri Nets and Other Models of Concurrency – ICATPN 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73094-1_24

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5506900
• Decidability problems in Petri nets with names and replication
• Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
• Forward analysis for Petri nets with name creation
• Petri nets with name creation for transient secure association

Cited in

(5)

• A classification of the expressive power of well-structured transition systems
• Petri nets with name creation for transient secure association
• Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
• scientific article; zbMATH DE number 5506900 (Why is no real title available?)
• Towards Efficient Verification of Systems with Dynamic Process Creation

This page was built for publication: Name Creation vs. Replication in Petri Net Systems

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