Deadlocks and livelocks in transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 88 LNCS, Issue , 1980, Pages 587-600

  Sifakis, Joseph ^a  

^a IMAG CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034976102     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0022535     Document Type: Conference Paper

References (23)

1. Advanced Course on general net theory of processes and systems. Hamburg University, October 1979 (to be published by Springer Verlag).
2. E.A. ASHCROFT: “Proving assertions about parallel programs”. Journal of Comp. and Syst. Science, 10, 1975, pp. 110–135.
3. E.G. COFFMAN Jr., M.J. ELPHICK, A. SHOSHANI: “System Deadlocks”. Comp. Surveys, ACM, Vol.3, no 2, June 1971, pp.67–78.
4. E.W. DIJKSTRA: “Hierarchical ordering of sequential processes”. Acta Informatica, 1, 2, October 1971, pp. 115–138.
5. E.W. DIJKSTRA: “Guarded commands, non determinacy and formal derivation of programs”. Comm. ACM, vol.18, no 8, August 1975, pp. 453–457.
6. E.W. DIJKSTRA: “A discipline of programming”. Prentice Hall Inc., 1976.
7. 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.
8. P. GUERREIRO: “Un modèle relationnel pour les programmes non-déterministes”. DEA report, IMAG, Grenoble, June 1979.
9. C.A.R. HOARE: “Some properties of predicate transformers”. J.A.C.M., vol.25, no 3, July 1978, pp. 461–480.
10. R.C. HOLT: “Comments on prevention of system dealocks”. Comm. ACM, vol.14, no 1, January 1971, pp. 36–38.
11. R.C. HOLT: “Some deadlock properties of computer systems”. Comp. Surveys, ACM, vol.4, no 2, September 1972, pp.179–196.
12. R.M. KELLER: “Vector replacement systems: a formalism modeling asynchronous systems”. Princeton University, Technical report no 117, December 1972.
13. R.M. KELLER: “Formal verification of parallel programs”. Comm. ACM, vol.19, no 7, July 1976, pp. 371–384.
14. D.E. KNUTH: “Additional comments on a problem in concurrent programming control”. Comm. ACM, vol.9, no 9, May 1966, pp. 321–322.
15. Y.S. KWONG: “On reduction of asynchronous systems”. Theoretical Comp. Science, 5, 1977, pp. 25–50.
16. 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.
17. 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.
18. D. PARK: “Fixpoint induction and proofs of program properties” in Machine Intelligence 5, 1969, pp. 59–78.
19. 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.
20. B.K. ROSEN: “Correctness of parallel programs: the Church-Rosser approach”. Theoretical Comp. Science, 2, 1976, pp. 183–207.
21. J. SIFAKIS: “A unified approach for studying the properties of transition systems”. IMAG, report RR 179, December 1979.
22. J. SIFAKIS: “Deadlocks and livelocks in transition systems”. IMAG, report RR 185, January 1980.
23. A. TARSKI: “A lattice-theoretical fixpoint theorem and its applications”. Pacific Journal of Mathematics, 5, 1955, pp. 285–309.