Lectures on Concurrency and Petri Nets

DOI10.1007/b98282zbMath1088.68123OpenAlexW78026558MaRDI QIDQ5712276

Philippe Darondeau

Publication date: 23 December 2005

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

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

Mathematics Subject Classification ID

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

Related Items (8)

Reduction rules for reset/inhibitor nets ⋮ Process Discovery Using Localized Events ⋮ Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems ⋮ Distributed Control of Discrete-Event Systems: A First Step ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ Discovering Block-Structured Process Models from Incomplete Event Logs ⋮ Soundness-preserving reduction rules for reset workflow nets ⋮ The Power of Prime Cycles

This page was built for publication: Lectures on Concurrency and Petri Nets