Token-Free Petri Nets

DOI10.1007/978-3-540-78127-1_27zbMATH Open1134.68041OpenAlexW2167526336MaRDI QIDQ5452194

Antoni Mazurkiewicz

Publication date: 25 March 2008

Published in: Pillars of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78127-1_27

Mathematics Subject Classification ID

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

Related Items (5)

Adjunct partial array token Petri net structure ⋮ Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems ⋮ Partial array token Petri net and \(P\) system ⋮ Unifying Petri Net Semantics with Token Flows ⋮ Token-passing nets: call-by-need for free

This page was built for publication: Token-Free Petri Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452194)