Decidability problems in Petri nets with names and replication

DOI10.3233/FI-2010-368MaRDI QIDQ3084987zbMATH OpenOpenAlexFDO

Authors Fernando Rosa-Velardo, David de Frutos Escrig

Publication date 28 March 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-368

zbMATH Keywords

choreographydecidabilityinfinite state systemsmultithreadingPetri netspure namessecurity

Mathematics Subject Classification ID

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

Recommendations

• Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
• Decidability and complexity of Petri nets with unordered data
• Decidability of the Petri net reachability problem
• Accelerations for the coverability set of Petri nets with names
• scientific article; zbMATH DE number 1223710

Cited in

(13)

• Aligning event logs to resource-constrained \(\nu \)-Petri nets
• Petri nets with name creation for transient secure association
• Model checking Petri nets with names using data-centric dynamic systems
• Accelerations for the coverability set of Petri nets with names
• Forward analysis for Petri nets with name creation
• Depth boundedness in multiset rewriting systems with name binding
• Replicated Ubiquitous Nets
• scientific article; zbMATH DE number 5506900 (Why is no real title available?)
• Name Creation vs. Replication in Petri Net Systems
• Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
• Decidability and complexity of Petri nets with unordered data
• Exact and approximated log alignments for processes with inter-case dependencies
• Multiset rewriting for the verification of depth-bounded processes with name binding

Describes a project that uses

Uses Software

• Renew

This page was built for publication: Decidability problems in Petri nets with names and replication

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