Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings

DOI10.3233/FI-2009-148zbMath1215.68157OpenAlexW2623546552MaRDI QIDQ3400553

Eric Fabre, Agnes Madalinski

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

zbMATH Keywords

category theorydistributed systemPetri netunfoldingpullbackmodular computationfinite complete prefix

Mathematics Subject Classification ID

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

Related Items (1)

Distributed computation of vector clocks in Petri net unfoldings for test selection

This page was built for publication: Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings