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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: Reasoning about programs, University Video Communications, Stanford. The Distinguished Lecture Series, Academic Leaders in Computer Science and Electrical Engineering, vol. III (1990)
Gries, D.: The Science of Programming, pp. 165–301. Springer, Heidelberg (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Reisig, W. (2008). The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds) Pillars of Computer Science. Lecture Notes in Computer Science, vol 4800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78127-1_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-78127-1_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78126-4
Online ISBN: 978-3-540-78127-1
eBook Packages: Computer ScienceComputer Science (R0)