Liveness in Timed and Untimed Systems

Information and Computation

Volumn 141, Issue 2, 1998, Pages 119-171

  Segala, Roberto ^a   Gawlick, Rainer ^b   Søgaard Andersen, Jørgen ^c   Lynch, Nancy ^d  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Automata; Formal verification; I O automata; Liveness; Receptiveness; Simulation techniques; Timed automata

Indexed keywords

EID: 0004540627     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2671     Document Type: Article

References (27)

1. Abadi, M. and Lamport, L. (1991), The existence of refinement mappings, Theoret. Comput. Sci. 2(82), 253-184.
2. Abadi, M. and Lamport, L. (1993), Composing specifications, ACM Trans. Programming Languages Systems 15(1), 73-132.
3. Abadi, M. and Lamport, L. (1994), An old-fashioned recipe for real time, ACM Trans. Programming Languages Systems 16(5), 1543-1571.
4. Alpern, B. and Schneider, F. B. (1985), Defining liveness, Inform. Process. Lett. 21(4), 181-185.
5. Bosscher, D. J. B., Polak, I., and Vaandrager, F. W. (1994), Verification of an audio control protocol, in "Proceedings of the Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems," (Langmaack, de Roever, and Vytopil, Eds.), Lecture Notes in Computer Science, Vol. 863, pp. 170-192, Springer-Verlag, Berlin/New York [Full version available as Report CS-R9445, CWI, Amsterdam, July 1994].
6. De Nicola, R., and Hennessy, M. (1984), Testing equivalences for processes, Theor. Comput. Sci. 34, 83-133.
7. Dill, D. (1988), "Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits," ACM distinguished Dissertations, MIT Press, Cambridge, MA.
8. Fischer, M. (June 25, 1985), Re: Where are you?, e-mail message to Leslie Lamport.
9. Gawlick, R., Segala, R., Søgaard-Andersen, J. F., and Lynch, N. A. (1993), "Liveness in Timed and Untimed Systems," Technical Report MIT/LCS/TR-587, MIT Laboratory for Computer Science.
10. Gawlick, R., Segala, R., Søgaard-Andersen, J. F., and Lynch, N. A. (1994), Liveness in Timed and untimed systems, in "Proceedings, 21th ICALP, Jerusalem" (S. Abiteboul and E. Shamir, Eds.), Lecture Notes in Computer Science, Vol. 820, Springer-Verlag, Berlin/ New York [A full version appears as MIT Technical Report MIT/LCS/TR-587].
11. Hoare, C. A. R. (1985), "Communicating Sequential Processes," Prentice-Hall International, Englewood Cliffs, NJ.
12. Jonsson, B. (1991), Simulations between specifications of distributed systems, in "Proceedings of CONCUR 91, Amsterdam," (J. C. M. Beeten and J. F. Groote, Eds.), Lecture Notes in Computer Science, Vol. 527, pp. 346-360, Springer-Verlag, Berlin/New York.
13. Laport, L. (1994), The temporal logic of actions, ACM Trans. Programming Languages Systems 16(3), 872-923.
14. Lynch, N. A., and Stark, E. W. (1989), A proof of the Kahn principle for Input/Output automata, Inform. and Comput. 82, 81-92.
15. Lynch, N. A., and Tuttle, M. R. (1987), Hierarchical correctness proofs for distributed algorithms, in "Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, 1987," pp. 137-151. [A full version is available as MIT Technical Report MIT/LCS/TR-387]
16. Lynch, N., and Vaandrager, F. (1995), Forward and backward simulations. I. Untimed systems, Inform. and Comput. 121, 214-233.
17. Lynch, N., and Vaandrager, F. (1996), Forward and backward simulations. II. Timing-based systems, Inform. and Comput. 128, 1-25.
18. Maler, O., Manna, Z., and Pnueli, A. (1991), From timed to hybrid systems, in "Proceedings of the REX workshop 'Real-Time Theory in Practice'" (J. W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 600, pp. 447-484, Springer-Verlag, Berlin/New York.
19. Merritt, M., Modugno, F., and Tuttle, M. (1991) Time constrained automata, in "Proceedings of CONCUR 91, Amsterdam" (J. C. M. Baeten, and J. F. Groote, Eds.), Lecture Notes in Computer Science, Vol. 527, pp. 408-423, Springer-Verlag, Berlin/ New York.
20. Nicollin, X., and Sifakis, J. (1992), An overview and synthesis on timed process algebras, in "Proceedings of the Third Workshop on Computer Aided Verification, Aalborg, 1991," (K. G. Larsen, and A. Skou, Eds.), Lecture Notes in Computer Science, Vol. 575, pp. 376-398, Springer-Verlag, Berlin/New York.
21. Plotkin, G. D. (1981), "A Structural Approach to Operational Semantics," Technical Report DAIMI FN-19, Computer Science Department, Aarhus University.
22. Romijn, J. M. T., and Vaandrager, F. (1996), A note on fairness in I/O automata, Inform. Process. Lett. 59(5), 245-250.
23. Reingold, N., Wang, D. W., and Zuck, L. D. (1992), Games I/O automata play, in "Proceedings of CONCUR 92, Story Brook, NY" (W. R. Cleeveland, Ed.), Lecture Notes in Computer Science, Vol. 630, pp. 325-339, Springer-Verlag, Berlin/New York.
24. Segala, R. (1993), Quiescence, fairness, testing and the notion of implementation, in "Proceedings of CONCUR 93, Hildesheim" (E. Best, Ed.), Lecture Notes in Computer Science, Vol. 715, Springer-Verlag, Berlin/New York.
25. Søgaard-Andersen, J. F., Lampson, B., and Lynch, N. A. (1993), Correctness of at-most-once message delivery protocols, in "FORTE '93 - Sixth International Conference on Formal Description Techniques".
26. Søgaard-Andersen, J. F., Lynch, N. A., and Lampson, B. W. (1993), "Correctness of Communication Protocols. A Case Study," Technical Report MIT/LCS/TR-589, MIT Laboratory for Computer Science.
27. Vaandrager, F. W., and Lynch, N. A. (1992), Action transducers and timed automata, in "Proceedings of CONCUR 92, Story Brook, NY" (W. R. Cleeveland, Ed.), Lecture Notes in Computer Science, Vol. 630, pp. 436-155, Springer-Verlag, Berlin/New York.