Accelerations for the coverability set of Petri nets with names

zbMATH Open1248.68357MaRDI QIDQ3225720FDOQ3225720

Authors: Fernando Rosa-Velardo, María Martos-Salgado, David de Frutos Escrig 

Publication date: 22 March 2012

Full work available at URL: http://iospress.metapress.com/content/h730166n666n20nw/fulltext.html

Recommendations

• Forward analysis for Petri nets with name creation
• The complexity of coverability in \(\nu\)-Petri nets
• Decidability problems in Petri nets with names and replication
• Decidability and complexity of Petri nets with unordered data
• \(\omega\)-Petri nets: algorithms and complexity

zbMATH Keywords

decidabilityPetri netscoverability setpure namesforward analysis\(\nu\)-PNs

Mathematics Subject Classification ID

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

Cited In (14)

• Coverability trees for Petri nets with unordered data
• The complexity of coverability in \(\nu\)-Petri nets
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. III: Karp-Miller trees
• Model checking Petri nets with names using data-centric dynamic systems
• Forward analysis for Petri nets with name creation
• Decidability problems in Petri nets with names and replication
• Depth boundedness in multiset rewriting systems with name binding
• Decidability and complexity of Petri nets with unordered data
• On the coverability and reachability languages of monotonic extensions of Petri nets
• A well-structured framework for analysing Petri net extensions
• A theory of name boundedness
• \(\omega \)-Petri nets
• Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication

This page was built for publication: Accelerations for the coverability set of Petri nets with names

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