Realizable and unrealizable specifications of reactive systems

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

Volumn 372 LNCS, Issue , 1989, Pages 1-17

  Abadi, Martín ^a   Lamport, Leslie ^a   Wolper, Pierre ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (37)

1. 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.
2. Bowen Alpern and Fred B. Schneider. Defining liveness. Information Processing Letters, 21:181-185, October 1985.
3. Bowen Alpern and Fred B. Schneider. Recognizing Safety and Liveness. Technical Report TR86-727, Department of Computer Science, Cornell University, January 1986.
4. 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.
5. J. Richard Buchi and Lawrence H, Landweber. Solving sequential conditions by finite state strategies. Transactions of the American Mathematical Society, 138:295-311, 1969.
6. J. R. Buchi. 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.
7. 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.
8. E. A. Emerson and E. M. Clarke. Using branching time logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241-266, 1982.
9. 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.
10. Harvey Friedman. Higher set theory and mathematical practice. Annals of Mathematical Logic, 2:326-357, 1971.
11. 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.
12. 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.
13. M. Hennessy. Why testing equivalence is natural. April 1987. Handwritten note.
14. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
15. David Harel and Amir Pnueli. On the development of reactive systems, pages 477-498. NATO ASI Series, FIS, Springer-Verlag, 1985.
16. 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.
17. 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.
18. Leslie Lamport. A simple approach to specifiying and verifying concurrent systems. Research Report 15, Digital Equipment Corporation, Systems Research Center, December 1986.
19. Michael G. Demons, Catastrophies and Communicating Processes. Technical Report CU-CS-343-86, Department of Computer Science, University of Colorado, July 1986.
20. Donald A. Martin. Borei determinacy. Annals of Mathematics, 102:363-371, 1975.
21. Donald A. Martin. Descriptive set theory: projective sets. In J. Barwise, editor, Handbook of Mathematical Logic, pages 783-815, North-Holland Publishing Co., 1977.
22. R. Daniel Mauldin, editor. The Scottish Book. Birkhäuser, Boston, 1981.
23. R. Milner. A Calculus of Communicating Systems. Volume 92 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1980.
24. R. Milner. A complete inference system for a class of regular behaviours. Journal of Compututer and System Science, 28:439-466, 1984.
25. 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.
26. 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.
27. J. Parrow. Fairness Properties in Process Algebra. PhD thesis, University of Uppsala, Sweden, 1985.
28. A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
29. 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.
30. Amir Pnueli and Roni Rosner. On the synthesis of an asynchronous reactive module. In Proceedings of ICALP 89, Stresa, July 1989.
31. M. O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
32. Shmuel Safra. On the complexity of omega-automata. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, White Plains, October 1988.
33. A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for Buchi automata with applications to temporal logic. Theoretical Computer Science, 49:217-237, 1987.
34. 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.
35. 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.
36. M. Y. Vardi and P. Wolper. Reasoning about infinite computation paths. 1988. To appear.
37. 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.