A calculus for timed automata: (Extended abstract)

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

Volumn 1135, Issue , 1996, Pages 110-129

  D’Argenio, Pedro R ^a   Brinksma, Ed ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; FAULT TOLERANCE; SEMANTICS;

ALGEBRAIC TECHNIQUES; EXTENDED ABSTRACTS; OPERATIONAL SEMANTICS; PARALLEL COMPOSITION; TIME-OUTS; TIMED AUTOMATA; TIMED BISIMULATION; TRANSITION SYSTEM;

REAL TIME SYSTEMS;

EID: 84947763253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61648-9_37     Document Type: Conference Paper

References (27)

1. R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. Minimization of timed transition systems. In W.R. Cleaveland, editor, Proceedings CONCUR 92, Stony Brook, NY, USA, volume 630 of Lecture Notes in Computer Science, pages 340-354. Springer-Verlag, 1992.
2. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
3. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
4. R. Alur and T.A. Henzinger. 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.
5. J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Journal of Formal Aspects of Computing Science, 3(2):142-188, 1991.
6. J.C.M. Baeten and J.A. Bergstra. Real time process algebra with infinitesimals. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes, Utrecht, 1994, Workshops in Computing, pages 148-187. Springer- Verlag, 1995.
7. J.C.M. Baeten and J.W. Klop, editors. Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
8. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. In P.H.L. van Eijk, C.A. Vissers, and M. Diaz, editors, The formal description technique LOTOS, pages 23-73. Elsevier Science Publishers, 1989.
9. T. Bologuesi and F. Lucidi. Timed process algebras with urgent interactions and a unique powerful binary operator. In de Bakker et al. [13], pages 124-148.
10. P.R. D’Argenio and E. Brinksma. A calculus for timed automata. Technical Report CTIT 96-13, Department of Computer Science, University of Twente, 1996.
11. J. Davies et al. Timed CSP: Theory and practice. In de Bakker et al. [13], pages 640-675.
12. C. Daws, A. Olivero, and S. Yovine. Verifying ET-LOTOS programs with KROo NOS. In Hogrefe and Leue [16], pages 207-222.
13. J.W. de Bakker, C. Huizing, W.P. de Roever, and G. Rozeuberg, editors. Proceedings REX Workshop on Real-Time: Theory in Practice, Mook, The Netherlands, June 1991, volume 600 of Lecture Notes in Computer Bcience. Springer-Verlag, 1992.
14. W.J. Fokkink. Clocks, Trees and Stars in Process Theory. PhD thesis, University of Amsterdam, December 1994.
15. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111:193-244, 1994.
16. Th International Conference on Formal Description Techniques, FORTE'94. North-Holland, 1994.
17. A.S. Klusener. Models and azioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, December 1993.
18. G. Leduc and L. Léonard. A formal definition of time in LOTOS. In Revised draft on enhancements to LOTOS, 1994. Annex G of document ISO/IEC JTC1/SC21/WG1/Q48.6.
19. N.A. Lynch and F.W. Vaandrager. Forward and backward simulations - part II: Timing-based systems. Report CS-R9314, CWI, Amsterdam, March 1993. To appear in Information and Computation.
20. N.A. Lynch and F.W. Vaandrager. Action transducers and timed automata. Report CS-R9460, CWI, Amsterdam, November 1994. To appear in Formal Aspects of Computing.
21. R. Milner. Communication and Concurrency. Prentice-Hall International, Eaglewood Cliffs, 1989.
22. F. Moller and C. Tofts. A temporal calculus of communicating systems. In Baeten and Klop [7], pages 401-415.
23. X. Nicollin and J. Sifakis. The algebra of timed processes ATP: Theory and application. Information and Computation, 114(1):131-178, 1994.
24. X. Nicollin, J. Sifakis, and S. Yovine. Compiling real-time specifications into extended automata. IEEE Transactions on Software Engineering, 18(9):794-804, September 1992.
25. X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. Aeta Informatiea, 30(2):181-202, 1993.
26. W. Yi. Real-time behaviour of asynchronous agents. In Baeten and Klop [7], pages 502-520.
27. W. Yi, P. Pettersson, and M. Daniels. Automatic verification of real-time communicating systems by constraint-solving. In Hogrefe and Leue [16], pages 223-238.