Abstract
The Scholten/Dijkstra "Pebble Game" is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant. Technically this is achieved by exploiting the local and the reversible nature of Petri Net transitions. Furthermore, these properties allow to retain the verification arguments of the algorithm. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Reisig, W. (2008). The Scholten/Dijkstra Pebble Game played straightly, distributedly, online and reversed. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4800 LNCS, pp. 589–595). https://doi.org/10.1007/978-3-540-78127-1_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
