Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs

DOI10.1007/978-3-319-45994-3_4zbMath1478.68186OpenAlexW2520726580MaRDI QIDQ1708655

Harro Wimmel, Eike Best

Publication date: 26 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-45994-3_4

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs