Applications and Theory of Petri Nets 2005

DOI10.1007/b136988zbMath1128.68391OpenAlexW2507030177MaRDI QIDQ5713505

Alexander Serebrenik, K. M. van Hee, Marc Voorhoeve, Natalia Sidorova

Publication date: 14 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136988

zbMATH Keywords

verificationPetri netsconcurrencyworkflowresources

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource ⋮ Model checking Petri nets with names using data-centric dynamic systems ⋮ On the Synthesis of Zero-Safe Nets ⋮ Correctness Notions for Petri Nets with Identifiers ⋮ Soundness of workflow nets: classification, decidability, and analysis ⋮ Decidability and complexity of Petri nets with unordered data

This page was built for publication: Applications and Theory of Petri Nets 2005