Action transducers and timed automata

Formal Aspects of Computing

Volumn 8, Issue 5, 1996, Pages 499-538

  Lynch, Nancy ^a   Vaandrager, Frits ^b,c,d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^c PSL RESEARCH UNIVERSITY   (France)

^d CWI   (Netherlands)

Author keywords

Action transducers; Congruence properties; Process algebra; Real time; Timed automata; Timed trace inclusion

Indexed keywords

EID: 0004505683     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01211907     Document Type: Article

References (47)

1. Abadi, M. and L, Lamport.: An old-fashioned recipe for real time. In de Bakker et al. [dBH92], pages 1-27.
2. Alur, R. and Dill, D.L.: A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. Alur, R. and Henzinger, T.A.: Real-time system = discrete system + clock variables. In T. Rus and C. Rattray, editors, Theories and Experiences for Real-Time System Development - Papers presented at First AMAST Workshop on Real-Time System Development, Iowa City, Iowa, November 1993, pages 1-29. World Scientific, 1994.
4. Baeten, J.C.M. and Bergstra, J.A.: Real time process algebra. Formal Aspects of Computing, 3(2):142-188, 1991.
5. Baeten, J.C.M. and Klop, J.W.: editors. Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
6. Baeten, J.C.M. and Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18 Cambridge University Press, 1990.
7. Bakker, J.W. de, Huizing, C., de Roever, W.P. and Rozenberg, G.: editors. Proceedings REX Workshop on Real-Time: Theory in Practice, Mook, The Netherlands, June 1991, volume 600 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
8. Bergstra, J.A., Bethke, I. and Ponse, A.: Process algebra with iteration and nesting. The Computer Journal, 37(4):243-258, 1994.
9. th ACM Symposium on Principles of Programming Languages, San Diego, California, pages 229-239, 1988. Full version available as Technical Report 90-1150, Department of Computer Science, Cornell University, Ithaca, New York, August 1990. Accepted to appear in Journal of the ACM.
10. th ACM Symposium on Principles of Programming Languages, San Diego, California, pages 229-239, 1988. Full version available as Technical Report 90-1150, Department of Computer Science, Cornell University, Ithaca, New York, August 1990. Accepted to appear in Journal of the ACM.
11. Bosscher, D.J.B. Polak, I. and Vaandrager, F.W.: Verification of an audio control protocol. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Proceedings of the Third International School and Symposium on Formal Techniques in Real Time and Fault Tolerant Systems, Lübeck, Germany, September 1994, volume 863 of Lecture Notes in Computer Science, pages 170-192. Springer-Verlag. 1994. Full version available as Report CS-R9445, CWI, Amsterdam, July 1994.
12. Brinksma, E.: On the design of Extended LOTOS - a specification language for open distributed systems. PhD thesis. Department of Computer Science, University of Twente, 1988.
13. Davies, J. and Schneider, S.: An introduction to Timed CSP. Technical Monograph PRG-75, Oxford University Computing Laboratory, Programming Research Group, August 1989.
14. Fokkink, W.J. and Zantema, H.: Basic process algebra with iteration: Completeness of its equational axioms. The Computer Journal, 37(4):259-267, 1994.
15. th ICALP, Jerusalem, volume 820 of Lecture Notes in Computer Science. Springer-Verlag, 1994. A full version appears as MIT Technical Report number MIT/LCS/TR-587.
16. Glabbeek, R.J. van: The linear time - branching time spectrum II (the semantics of sequential systems with silent moves). In E. Best, editor, Proceedings CONCUR 93. Hildesheim, Germany, volume 715 of Lecture Notes in Computer Science, pages 66-81. Springer-Verlag, 1993.
17. Groote, J.F. and Ponse, A.: Proof theory for μCKL: A language for processes with data. In D.J. Andrews, J.F. Groote, and C.A. Middelburg, editors, Proceedings of the International Workshop on Semantics of Specification Languages, Workshops in Computer Science, pages 231-250. Springer-Verlag, 1993.
18. Groote, J.F. and Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202-260, October 1992.
19. Heitmeyer, C. and Lynch, N.A.: The generalized railroad crossing - a case study in formal verification of real-time systems. In Proceedings 15th IEEE Real-Time Systems Symposium, San Juan, Puerto Rico, pages 120-131, December 1994.
20. th Annual Symposium on Logic in Computer Science, Santa Cruz, California, pages 394-406. IEEE Computer Society Press, 1992.
21. Hoare, C.A R.: Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.
22. Jeffrey, A.S.A., Schneider, S.A. and Vaandrager, F.W.: A comparison of additivity axioms in timed transition systems. Report CS-R9366, CWI, Amsterdam, November 1993.
23. Kleene, S.C.: Representation of events in nerve nets and finite automata. In Automata Studies, pages 3-41. Princeton University Press, 1956.
24. Kluseneri A.S.: Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Technical University of Eindhoven, December 1993.
25. Lamport, L.: How to write a long formula. Formal Aspects of Computing, 6(5):580-584, 1994.
26. Lampson, B.W., Lynch, N.A. and Søgaard-Andersen, J.F.: Correctness of at-most-once message delivery protocols. In FORTE'93 - Sixth International Conference on Formal Description Techniques. Boston, MA, October 1993, pages 387-402, 1993.
27. th ICALP, Warwick, volume 443 of Lecture Notes in Computer Science, pages 526-539. Springer-Verlag, July 1990. An extended version appeared as: Report R89-13, The University of Aalborg, Dept. of Mathematics and Computer Science, Aalborg, Denmark, May 1989.
28. Lynch, N.A. and Attiya, H.: Using mappings to prove timing properties. Distributed Computing, 6(2):121-139, 1992.
29. th Annual ACM Symposium on Principles of Distributed Computing, pages 137-151, August 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.
30. Lynch, N.A. and Vaandrager, F.W.: Forward and backward simulations for timing-based systems. In de Bakker et al. [dBH92]. pages 397-446.
31. Lynch, N.A. and Vaandrager, F.W.: Forward and backward simulations - part II: Timing-based systems. Report CS-R9314, CWI, Amsterdam, March 1993. Also, MIT/LCS/TM-487.b. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA. To appear in Information and Computation.
32. Manna, Z. and Pnueli, A.: Verifying hybrid systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors, Hybrid Systems, volume 736 of Lecture Notes in Computer Science, pages 4-35. Springer-Verlag, 1993.
33. Merritt, M., Modugno, F. and Tuttle, M.: Time constrained automata. In J.C.M. Baeten and J.F. Groote, editors. Proceedings CONCUR 91, Amsterdam, volume 527 of Lecture Notes in Computer Science, pages 408-423. Springer-Verlag, 1991.
34. Milne, G.J.: CIRCAL and the representation of communication, concurrency, and time. ACM Transactions on Programming Languages and Systems, 7(2):270-298, 1985.
35. Milner, R.: Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.
36. Moller, F. and Tofts, C.: A temporal calculus of communicating systems. In Baeten and Klop [BaK90], pages 401-415.
37. th ICALP, Vienna, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
38. Nicollin, X. and Sifakis, J.: An overview and synthesis on timed process algebras. In K.G. Larsen and A. Skou, editors, Proceedings of the 3rd International Workshop on Computer Aided Verification, Aalborg, Denmark, volume 575 of Lecture Notes in Computer Science, pages 376-398. Springer-Verlag, 1992.
39. Nicollin, X. and Sifakis, J.: The algebra of timed processes ATP: Theory and application. Information and Computation, 114(1):131-178, 1994.
40. Nicollin, X., Sifakis, J. and Yovine, S.: From ATP to timed graphs and hybrid systems. Acta Informatica, 30(2):181-202, 1993.
41. Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
42. Reed, G.M. and Roscoe, A.W.: A timed model for communicating sequential processes. Theoretical Computer Science, 58:249-261, 1988.
43. Simone, R. de: Higher-level synchronising devices in MEUE-SCCS. Theoretical Computer Science, 37:245-267, 1985.
44. Søgaard-Andersen, J.F., Lampson, B.W. and Lynch, N.A.: Correctness of communication protocols - a case study. Technical Report MIT/LCS/TR-589, Laboratory for Computer Science, MIT, Cambridge, MA, November 1993.
45. th Annual Symposium on Logic in Computer Science, Amsterdam, pages 387-398. IEEE Computer Society Press, 1991.
46. Vaandrager, F.W.: Expressiveness results for process algebras. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, Proceedings REX Workshop on Semantics: Foundations and Applications, Beekbergen, The Netherlands, June 1992, volume 666 of Lecture Notes in Computer Science, pages 609-638. Springer-Verlag, 1993.
47. Wang Yi: Real-time behaviour of asynchronous agents. In Baeten and Klop [BaK90], pages 502-520.