Abstract
We present a new solution of the mutual exclusion problem, which is modelled as a Petri net. In order to present a concise model of the algorithm, we extend Petri nets by the concepts of progress and non-progress transitions and fair arcs.
Moreover, we introduce a simple temporal logic in order to express and verify properties of distributed algorithms. The verification rules allow for rigorous reasoning close to the arguments of an informal proof.
The verification method is applied to the new solution as well as to Peterson’s solution. This allows for a comparison of the two algorithms.
supported by the Deutsche Forschungs Gemeinschaft SFB 342, TP YE1, the ESPRIT Basic Research WG 6067 Caliban and the DFG-Project: Distributed Algorithms
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
K. R. Apt and E. R. Olderog. Programmverifikation. Springer-Verlag, 1994.
M. Ben-Ari. Mathematical Logic for Computer Science. Prentice Hall, 1993.
E. Best. Representing a program invariant as a linear invariant in a Petri net. EATCS Bulletin, (17): 2–11, June 1982.
E. Best. Semantik. Vieweg-Verlag, 1995.
E. Best and C. Fernández. Nonsequential Processes, volume 13 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.
K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
E. Dijkstra. Solution of a problem in concurrent programming control. Communication of the ACM, 8 (9): 569, 1965.
R. W. Doran and L. K. Thomas. Variants of the sofware solutions to mutual exclusion. Information Processing Letters, 10 (4,5): 206–208, 1980.
D.E. Knuth. Additional comments on a problem in concurrent programming control. Communications of the ACM, 9 (5): 321–322, 1966.
L. Lamport. A new solution to Dijkstra’s concurrent programming problem. Communications of the ACM, 21 (7): 453–455, 1974.
Z. Manna and A. Pnueli. A temporal proof methodology for reactive systems. In M. Broy, editor, Programm Design Calculi, volume 118 of NATO ASI Series F, pages 287–323, 1992.
S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems, 4 (3): 455–495, July 1982.
G.L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12 (3): 115–116, 1981.
M. Raynal. Algorithms for Mutual Exclusion. The MIT Press, 1986.
W. Reisig. Correctness proofs of distributed algorithms. Informatik- Bericht 38, Humboldt-University of Berlin, 1994.
W. Reisig. Petri Nets, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1982.
P.S. Thiagarajan. Elementary net systems. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, volume 254 of LNCS, pages 26–59. Springer-Verlag, September 1986.
J. L. A. van de Snepscheut. What Computing is all about. Springer-Verlag, 1993.
D. J. Walker. Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing, (l): 273–292, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 British Computer Society
About this paper
Cite this paper
Kindler, E., Walter, R. (1995). Message passing mutex. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_14
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3078-9_14
Publisher Name: Springer, London
Print ISBN: 978-3-540-19982-3
Online ISBN: 978-1-4471-3078-9
eBook Packages: Springer Book Archive