Decidability Problems in Petri Nets with Names and Replication

DOI10.3233/FI-2010-368zbMath1209.68341OpenAlexW1629112568MaRDI QIDQ3084987

David de Frutos-Escrig, Fernando Rosa-Velardo

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

securityPetri netsdecidabilitymultithreadingchoreographyinfinite state systemspure names

Mathematics Subject Classification ID

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

Related Items (4)

Aligning event logs to resource-constrained \(\nu \)-Petri nets ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ Petri nets with name creation for transient secure association

Uses Software

• Renew

This page was built for publication: Decidability Problems in Petri Nets with Names and Replication