This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Advanced Course on general net theory of processes and systems. Hamburg University, October 1979 (to be published by Springer Verlag).
E.A. ASHCROFT: “Proving assertions about parallel programs”. Journal of Comp. and Syst. Science, 10, 1975, pp. 110–135.
E.G. COFFMAN, JR., M.J. ELPHICK, A. SHOSHANI: “System Deadlocks”. Comp. Surveys, ACM, Vol.3, no2, June 1971, pp.67–78.
E.W. DIJKSTRA: “Hierarchical ordering of sequential processes”. Acta Informatica, 1, 2, October 1971, pp. 115–138.
E.W. DIJKSTRA: “Guarded commands, non determinacy and formal derivation of programs”. Comm. ACM, vol.18, no8, August 1975, pp. 453–457.
E.W. DIJKSTRA: “A discipline of programming”. Prentice Hall Inc., 1976.
L. FLON & N. SUZUKI: “Non determinism and the correctness of parallel programs” in “Formal description of programming concepts”. North Holland Publ. Co., 1978, pp. 589–608.
P. GUERREIRO: “Un modèle relationnel pour les programmes non-déterministes”. DEA report, IMAG, Grenoble, June 1979.
C.A.R. HOARE: “Some properties of predicate transformers”. J.A.C.M., vol.25, no3, July 1978, pp. 461–480.
R.C. HOLT: “Comments on prevention of system dealocks”. Comm. ACM, vol.14, no1, January 1971, pp. 36–38.
R.C. HOLT: “Some deadlock properties of computer systems”. Comp. Surveys, ACM, vol.4, no2, September 1972, pp.179–196.
R.M. KELLER: “Vector replacement systems: a formalism modeling asynchronous systems”. Princeton University, Technical report no 117, December 1972.
R.M. KELLER: “Formal verification of parallel programs”. Comm. ACM, vol.19, no7, July 1976, pp. 371–384.
D.E. KNUTH: “Additional comments on a problem in concurrent programming control”. Comm. ACM, vol.9, no9, May 1966, pp. 321–322.
Y.S. KWONG: “On reduction of asynchronous systems”. Theoretical Comp. Science, 5, 1977, pp. 25–50.
Y.S. KWONG: “On the absence of livelocks in parallel programs”, in Springer Lecture notes in Computer science no 70, Semantics of concurrent computation, July 1979, pp. 172–190.
A. van LAMSWEERDE and M. SINTZOFF: “Formal derivation of strongly correct parallel programs”. MBLE Research Lab., report R338, October 1976, and Acta Informatica 12, fasc. 1, 1979, pp. 1–31.
D. PARK: “Fixpoint induction and proofs of program properties” in Machine Intelligence 5, 1969, pp. 59–78.
W.P. de ROEVER: “Dijkstra's predicate transformer, non determinism, recursion and termination”. Springer Lecture notes in Computer science no 45, MFCS, 1976, pp. 472–481.
B.K. ROSEN: “Correctness of parallel programs: the Church-Rosser approach”. Theoretical Comp. Science, 2, 1976, pp. 183–207.
J. SIFAKIS: “A unified approach for studying the properties of transition systems”. IMAG, report RR 179, December 1979.
J. SIFAKIS: “Deadlocks and livelocks in transition systems”. IMAG, report RR 185, January 1980.
A. TARSKI: “A lattice-theoretical fixpoint theorem and its applications”. Pacific Journal of Mathematics, 5, 1955, pp. 285–309.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sifakis, J. (1980). Deadlocks and livelocks in transition systems. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022535
Download citation
DOI: https://doi.org/10.1007/BFb0022535
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive