Realizable and unrealizable specifications of reactive systems

  • Martín Abadi
  • Leslie Lamport
  • Pierre Wolper
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 372)


Transition System Finite Automaton Safety Property Parallel Composition Winning Strategy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AL88]
    Martín Abadi and Leslie Lamport. The Existence of Refinement Mappings. Research Report SRC29, Digital Equipment Corporation, Systems Research Center, August 1988. A short version of this paper appeared in the Proceedings of the Third Annual Symposium on Logic in Computer Science.Google Scholar
  2. [AS85]
    Bowen Alpern and Fred B. Schneider. Defining liveness. Information Processing Letters, 21:181–185, October 1985.CrossRefGoogle Scholar
  3. [AS86]
    Bowen Alpern and Fred B. Schneider. Recognizing Safety and Liveness. Technical Report TR86-727, Department of Computer Science, Cornell University, January 1986.Google Scholar
  4. [BHR84]
    S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(7):560–599, 1984.CrossRefGoogle Scholar
  5. [BL69]
    J. Richard Büchi and Lawrence H. Landweber. Solving sequential conditions by finite state strategies. Transactions of the American Mathematical Society, 138:295–311, 1969.Google Scholar
  6. [Buc62]
    J. R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method and Philos. Sci. 1960, pages 1–12, Stanford University Press, Stanford, 1962.Google Scholar
  7. [Dav64]
    Morton Davis. Infinite games of perfect information. In M. Dresher, L. S. Shapley, and A. W. Tucker, editors, Advances in game theory, pages 85–101, Princeton University Press, Princeton, New Jersey, 1964.Google Scholar
  8. [EC82]
    E. A. Emerson and E. M. Clarke. Using branching time logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241–266, 1982.CrossRefGoogle Scholar
  9. [EJ88]
    E. Allen Emerson and Charanjit Jutla. The complexity of tree automata and logics of programs. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, White Plains, October 1988.Google Scholar
  10. [Fri71]
    Harvey Friedman. Higher set theory and mathematical practice. Annals of Mathematical Logic, 2:326–357, 1971.CrossRefGoogle Scholar
  11. [GH82]
    Yuri Gurevich and Leo Harrington. Trees, automata, and games. In Proceedings of the 14th Symposium on Theory of Computing, pages 60–65, ACM, May 1982.Google Scholar
  12. [GS53]
    D. Gale and F.M. Stewart. Infinite games with perfect information. In H. W. Kuhn and A. W. Tucker, editors, Contributions to the theory of games, Volume 2, pages 245–266, Princeton University Press, Princeton, New Jersey, 1953.Google Scholar
  13. [Hen87]
    M. Hennessy. Why testing equivalence is natural. April 1987. Handwritten note.Google Scholar
  14. [Hoa85]
    C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.Google Scholar
  15. [HP85]
    David Harel and Amir Pnueli. On the development of reactive systems, pages 477–498. NATO ASI Series, F13, Springer-Verlag, 1985.Google Scholar
  16. [HR72]
    R. Hossley and C. W. Rackoff. The emptiness problem for automata on infinite trees. In Proc. 13th IEEE Symp. on Switching and Automata Theory, pages 121–124, 1972.Google Scholar
  17. [Lam83]
    Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, IFIP, North Holland, Paris, September 1983.Google Scholar
  18. [Lam86]
    Leslie Lamport. A simple approach to specifiying and verifying concurrent systems. Research Report 15, Digital Equipment Corporation, Systems Research Center, December 1986.Google Scholar
  19. [Mai86]
    Michael G. Main. Demons, Catastrophies and Communicating Processes. Technical Report CU-CS-343-86, Department of Computer Science, University of Colorado, July 1986.Google Scholar
  20. [Mar75]
    Donald A. Martin. Borel determinacy. Annals of Mathematics, 102:363–371, 1975.Google Scholar
  21. [Mar77]
    Donald A. Martin. Descriptive set theory: projective sets. In J. Barwise, editor, Handbook of Mathematical Logic, pages 783–815, North-Holland Publishing Co., 1977.Google Scholar
  22. [Mau81]
    R. Daniel Mauldin, editor. The Scottish Book. Birkhäuser, Boston, 1981.Google Scholar
  23. [Mil80]
    R. Milner. A Calculus of Communicating Systems. Volume 92 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1980.Google Scholar
  24. [Mil84]
    R. Milner. A complete inference system for a class of regular behaviours. Journal of Compututer and System Science, 28:439–466, 1984.CrossRefGoogle Scholar
  25. [MW84]
    Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68–93, January 1984.CrossRefGoogle Scholar
  26. [Old85]
    E. R. Olderog. Process theory: semantics, specification and verification. In Proc. Advanced School on Current Trends in Concurrency, pages 442–509, Volume 224, LNCS, Springer-Verlag, Berlin, 1985.Google Scholar
  27. [Par85]
    J. Parrow. Fairness Properties in Process Algebra. PhD thesis, University of Uppsala, Sweden, 1985.Google Scholar
  28. [Pnu81]
    A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45–60, 1981.Google Scholar
  29. [PR89a]
    Amir Pnueli and Roni Rosner. On the synthesis of a reactive module. In Proceedings of the Sixteenth ACM Symposium on Principles of Programming Languages, Austin, January 1989.Google Scholar
  30. [PR89b]
    Amir Pnueli and Roni Rosner. On the synthesis of an asynchronous reactive module. In Proceedings of ICALP 89, Stresa, July 1989.Google Scholar
  31. [Rab69]
    M. O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1–35, 1969.Google Scholar
  32. [Saf88]
    Shmuel Safra. On the complexity of omega-automata. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, White Plains, October 1988.Google Scholar
  33. [SVW87]
    A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217–237, 1987.CrossRefGoogle Scholar
  34. [VW86a]
    M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. Symp. on Logic in Computer Science, pages 322–331, Cambridge, June 1986.Google Scholar
  35. [VW86b]
    M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182–221, April 1986.Google Scholar
  36. [VW88]
    M. Y. Vardi and P. Wolper. Reasoning about infinite computation paths. 1988. To appear.Google Scholar
  37. [WVS83]
    P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about infinite computation paths. In Proc. 24th IEEE Symposium on Foundations of Computer Science, pages 185–194, Tucson, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Martín Abadi
    • 1
  • Leslie Lamport
    • 1
  • Pierre Wolper
    • 2
  1. 1.Digital Equipment CorporationSystems Research CenterPalo AltoUSA
  2. 2.Institut Montefiore, B28Université de LiègeLiège Sart-TilmanBelgium

Personalised recommendations