Lectures on Concurrency and Petri Nets
From MaRDI portal
Publication:5712296
DOI10.1007/B98282zbMATH Open1088.68655OpenAlexW78026558MaRDI QIDQ5712296FDOQ5712296
Authors: Eike Best, Maciej Koutny
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
Recommendations
Cited In (16)
- The box algebra = Petri nets + process expressions
- Process algebra and model checking
- Partial-order process algebra (and its relation to Petri nets)
- An algebra of processes
- A regular viewpoint on processes and algebra
- A unified model for nets and process algebras
- Process algebras for Petri nets. The alphabetization of distributed systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An axiomatic characterization of algebras of processes of Petri nets
- A brief history of process algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- What are the fundamental structures of concurrency? We still don't know!
- Title not available (Why is that?)
This page was built for publication: Lectures on Concurrency and Petri Nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712296)