Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
From MaRDI portal
Publication:3400553
DOI10.3233/FI-2009-148zbMath1215.68157MaRDI QIDQ3400553
Publication date: 5 February 2010
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2009-148
category theory; distributed system; Petri net; unfolding; pullback; modular computation; finite complete prefix
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M14: Distributed systems
Related Items