The theory of timed I/O automata

Synthesis Lectures on Computer Science

Volumn 1, Issue , 2006, Pages 1-114

  Kaynar, Dilsun K ^a   Lynch, Nancy ^a   Segala, Roberto ^b   Vaandrager, Frits ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF VERONA   (Italy)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Formal modeling and verification; I O automata; Timed computing systems

Indexed keywords

AUTOMATED CONTROL; FORMAL MODELING; I/O AUTOMATA; TIMED COMPUTING SYSTEMS;

COMMUNICATION SYSTEMS; COMPUTER OPERATING SYSTEMS; COMPUTER SIMULATION; EMBEDDED SYSTEMS; REAL TIME SYSTEMS; RELIABILITY THEORY;

AUTOMATA THEORY;

EID: 33751076617     PISSN: 19321228     EISSN: 19321686     Source Type: Book Series    
DOI: 10.2200/S00006ED1V01Y200508CSL001     Document Type: Article

References (62)

1. S. Garland and N. A. Lynch, Using I/O automata for developing distributed systems. In G. T. Leavens and M. Sitaraman, editors, Foundations of Component-Based Systems. Cambridge University Press, New York, Ch. 13, pp. 285-312, 2000.
2. J. Sifakis, Modeling real-time systems - challenges and work directions. In Proc. Embedded Software, 1st Int. Workshop (EMSOFT'01), Tahoe City, CA. Lecture Notes in Computer Science, Vol. 2211. pp. 373-389, 2001.
3. J. Sifakis, Modeling real-time systems. In Proc. 25th IEEE Real-Time Systems Symposium (RTSS '04). IEEE Comput. Soc. Press, Los Alamitos, CA, pp. 5-6, 2004. Invited Talk.
4. N. A. Lynch, Distributed Algorithms. Morgan Kaufmann, San Fransisco, CA, 1996.
5. D. Kaynar, N. A. Lynch, and S. Mitra, Specifying and proving timing properties with TIOA tools. In Proc. 5th IEEE Int. Real-Time Systems Symposium, Work in Progress Session (RTSS WIP), Lisbon, Portugal, December 2004, pp. 96-99.
6. N. A. Lynch, R. Segala, and F. W. Vaandrager, Hybrid I/O automata. Information and Computation, 185(1): 105-157, 2003. doi:10.1016/S0890-5401(03) 00067-l
7. M. Merritt, F. Modugno, and M. Turtle, Time constrained automata. In J. C. M. Baeten and J. F. Groote, editors, Proc. CONCUR 91, Amsterdam. Lecture Notes in Computer Science, Vol. 527. Springer-Verlag, Berlin, pp. 408-423, 1991.
8. R. Segala, R. Gawlick, J. F. Søgaard-Andersen, and N. A. Lynch, Liveness in timed and untimed systems. Information and Computation, 141(2):119-171, 1998. doi:10.1006/inco.1997.2671
9. N. A. Lynch and F. W. Vaandrager, Forward and backward simulations - Part II: Timing-based systems. Information and Computation, 128(1):1-25, 1996. doi:10.1006/inco.1996.0060
10. N. A. Lynch and F. W. Vaandrager, Action transducers and timed automata. Formal Aspects of Computing, 8(5):499-538, 1996. doi:10.1007/BF01211907
11. R. Alur and D. L. Dill, A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994. doi:10.1016/0304-3975(94)90010-8
12. O. Maler, Z. Manna, and A. Pnueli, From timed to hybrid systems. In J. W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg, editors, Proc. REX Workshop on Real-Time: Theory in Practice, Mook, The Netherlands, June 1991. Lecture Notes in Computer Science, Vol. 600. Springer-Verlag, Berlin, pp. 447-484, 1992.
13. P. Petterson, Modelling and Verification of Real-Time Systems Using Timed Automata: Theory and Practice, PhD thesis. Department of Computer Systems, Uppsala University, 1999. Technical Report DoCs 99/101.
14. R. DePrisco, B. Lampson, and N. A. Lynch, Revisiting the Paxos algorithm. In M. Mavronicolas and P. Tsigas, editors, Distributed Algorithms, Proc. 11th Int. Workshop, WDAG'97, Saarbrücken, Germany, September 1997. Lecture Notes in Computer Science, Vol. 1320. Springer-Verlag, Berlin, pp. 111-125, 1997.
15. R. Alur, Timed automata. In Proc. 11th Int. Conf. Computer-Aided Verification (CAV). Lecture Notes in Computer Science, Vol. 1633. Springer-Verlag, Berlin, pp. 8-22, 1999. An earlier and longer version appears in NATO-ASI Summer School on Verification of Digital and Hybrid Systems, 1998.
16. R. Alur, S. La Torre, and P. Madhusudan, Perturbed timed automata. In Proc. 8th Int. Workshop Hybrid Systems: Computation and Control (HSCC), Zurich, Zwitserland, Lecture Notes in Computer Science, Vol. 3414. Springer-Verlag, Berlin, pp. 70-85, 2005.
17. R. Alur and P. Madhusudan, Decision problems for timed automata: A survey. In Int. School Formal Methods for the Design of Computer, Communication, and Software Systems (SFM-RT), Bertinoro, Italy. Lecture Notes in Computer Science, Vol. 3185. Springer-Verlag, Berlin, pp. 1-24, 2004.
18. K. G. Larsen, P. Pettersson, and W. Yi, Uppaal in a nutshell. Journal of Software Tools for Technology Transfer, 1/2:134-152, 1997. doi:1007/ s100090050010
19. R. Milner, A Calculus of Communicating Systems. Lecture Notes in Computer Science, Vol. 92. Springer-Verlag, Berlin, 1980.
20. C. Robson, TIOA and UPPAAL, Master's thesis. MIT Department of Electrical Engineering and Computer Science, 2004.
21. S. Yovine, Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer, 1(1/2): 123-133, 1997. doi:10.10007/s100090050009
22. C. Daws, A. Olivero, S. Tripakis, and S. Yovine, The tool Kronos. In Proc. of Hybrid Systems III, Verification and Control. Lecture Notes in Computer Science, Vol. 1066. Springer-Verlag, Berlin, pp. 208-219, 1996.
23. R. Alur, Techniques for Automatic Verification of Real-Time Systems, PhD thesis. Stanford University, 1991.
24. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic model-checking for real-time systems. Information and Computation, 111(2):193-244, 1994. doi:10.1006/inco.1994.1045
25. M. Bozga, S. Graf, Il. Ober, lui. Ober, and J. Sifakis, The IF toolset. In Proc. Formal Methods for the Design of Real-Time Systems. Lecture Notes in Computer Science, Vol. 3185. Springer-Verlag, Berlin, pp. 237-267, 2004.
26. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P. H. Ho, X. Nicolin, A. Olivero, J. Sifakis, and S. Yovine, The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995. doi:10.1016/0304-3975(94)00202-T
27. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi, HYTECH: A model checker for hybrid systems. In O. Grumberg, editor, Proc. 9th Int. Conf. Computer Aided Verification. Lecture Notes in Computer Science, Vol. 1254. Springer-Verlag, Berlin, pp. 460-463, 1997.
28. N. A. Lynch and A. Shvartsman, RAMBO: A reconfigurable atomic memory service for dynamic networks. In D. Malkhi, editor, Distributed Computing, Proc. 16th Int. Symp. Distributed Computing (DISC), Toulouse, France, October 2002. Lecture Notes in Computer Science, Vol. 2508. Springer-Verlag, Berlin, pp. 173-190, 2002. Technical Report MIT-LCS-TR-856.
29. C. A. Gunter, Semantics of Programming Languages: Structures and Techniques. MIT Press, Cambridge, MA, 1992.
30. M. Hennessy, Algebraic Theory of Processes. MIT Press, Cambridge, MA, 1988.
31. D. E. Knuth, Fundamental Algorithms, 2nd edition. The Art of Computer Programming, Vol. 1. Addision-Wesley, Reading, MA, 1973.
32. E. D. Sontag, Mathematical Control Theory - Deterministic Finite Dimensional Systems, Texts in Applied Mathematics, Vol. 6. Springer-Verlag, Berlin, 1990.
33. A. Pnueli, Development of hybrid systems. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Proc. 3rd Int. School Symp. Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'94), Lübeck, Germany, September 1994. Lecture Notes in Computer Science, Vol. 863. Springer-Verlag, Berlin, pp. 77-85, 1994.
34. J. W. Polderman and J. C. Willems, Introduction to Mathematical Systems Theory: A Behavioural Approach. Texts in Applied Mathematics, Vol. 26. Springer-Verlag, Berlin, 1998.
35. S. Mitra, Y. Wang, N. A. Lynch, and E. Feron, Safety verification of model helicopter controller using hybrid input/output automata. In O. Maler and A. Pnueli, editors, Proc. Hybrid Systems: Computation and Control, Prague, the Czech Republic April 3-5, 2003. Lecture Notes in Computer Science, Vol. 2623. Springer-Verlag, Berlin, pp. 343-358, 2003.
36. D. Kaynar, N. A. Lynch, S. Mitra, and S. Garland, The TIOA language, May 2005. Available: http://theory.csail.mit.edu/tds/reflist.html.
37. S. Garland, TIOA user guide and reference manual, September 2005. Available: http://theory.csail.mit.edu/tds/reflist.html.
38. S. Garland, D. Kaynar, N. A. Lynch, J. Tauber, and M. Vaziri, TIOA tutorial, May 2005. Available: http://theory.csail.mit.edu/tds/reflist.html.
39. R. Gawlick, R. Segala, J. F. Søgaard-Andersen, and N. A. Lynch, Liveness in timed and untimed systems. In S. Abiteboul and E. Shamir, editors, Proc. 21st ICALP, Jerusalem. Lecture Notes in Computer Science, Vol. 820. Springer-Verlag, Berlin, 1994.
40. A fùll version appears as MIT Technical Report number MIT/LCS/TR-587.
41. N. A. Lynch, R. Segala, F. W. Vaandrager, and H. B. Weinberg, Hybrid I/O automata. In R. Alur, T. A. Henzinger, and E. D. Sontag, editors, Hybrid Systems III. Lecture Notes in Computer Science, Vol. 1066. Springer-Verlag, Berlin, pp. 496-510, 1996.
42. N. A. Lynch, R. Segala, F. W. Vaandrager, and H. B. Weinberg, Hybrid I/O automata, Report CSI-R9907. Computing Science Institute, University of Nijmegen, April 1999.
43. J. M. T Romijn, A timed verification of the IEEE 1394 leader election protocol. Formal Methods in System Design, 19(2):165-194, 2001. Special issue on FMICS'99. doi:10.1023/A:1011284000753
44. D. P. L. Simons and M. I. A. Stoelinga, Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k. International Journal on Software Tools for Technology Transfer, 3(4):469-485, 2001.
45. N. A. Lynch and F. W. Vaandrager, Forward and backward simulations, I: Untimed systems. Information and Computation, 121(2):214-233, 1995. doi:/10.1006/inco.1995.1134
46. N. A. Lynch and M. R. Tuttle, An introduction to input/output automata. CWI Quarterly, 2(3):219-246, 1989.
47. S. Bornot and J. Sifakis, An algebraic framework for urgency. Information and Computation, 163:172-202, 2000. doi:10.1006/inco.2000.2999
48. Howard Bowman, Modelling timeouts without timelocks. In J.-R Katoen, editor, ARTS'99, 5th Int. AMAST Workshop Real-time and Probabilistic Systems. Lecture Notes in Computer Science, Vol. 1601. Springer, Berlin, pp. 334-353, May 1999.
49. D. Dill, Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits, ACM Distinguished Dissertations. MIT Press, Cambridge, MA, 1988.
50. M. Abadi and L. Lamport, Composing specifications. ACM Transactions on Programming Languages and Systems, 1(15):73-132, 1993. doi:10.1145/151646.151649
51. C. B. Jones, Specification and design of parallel programs. In R. E. A. Mason, editor, Information Processing 83: Proc. of the IFIP 9th World Congress, North-Holland, 1983, pp. 321-332.
52. A. Pnueli, In transition from global to modular temporal reasoning about programs. In K. R. Apt, editor, Logics and Models of Concurrent Systems, NATO ASI. Springer-Verlag, Berlin, pp. 123-144, 1984.
53. E. W. Stark, A proof technique for rely/guarantee properties. In S. N. Maheshwari, editor, Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, Vol. 206. Springer-Verlag, Berlin, pp. 369-391, 1985.
54. M. Abadi and L. Lamport, Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507-534, 1995.doi:1145/203095.20169
55. T. A. Henzinger, S. Qadeer, and S. K. Rajamani, Decomposing refinement proofs using assume-guarantee reasoning. In Proc. Int. Conf. Computer-Aided Design (ICCAD). IEEE Comput. Soc. Press, Los Alamitos, CA, pp. 245-252, 2000.
56. S. Tasiran, R. Alur, R. P. Kurshan, and R. K. Brayton, Verifying abstractions of timed systems. In Proc. 7th Conf. Concurrency Theory (CONCUR). Lecture Notes in Computer Science, Vol. 1119. Springer-Verlag, Berlin, 1996.
57. G. Frehse, Compositional Verification of Hybrid Systems using Simulation Relations, PhD thesis. Radboud University Nijmegen, October 2005.
58. D. Kaynar and N. A. Lynch, Decomposing verification of timed I/O automata. In Y. Lakhnech and S. Yovine, editors, Proc. Joint Int. Conf. Formal Modelling and Analysis of Timed Systems, FORMATS 2004 and Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2004, Grenoble, France, September 22-24, 2004. Lecture Notes in Computer Science, Vol. 3253. Springer-Verlag, Berlin, pp. 84-101, 2004.
59. S. Owre, J. Rushby, N. Shankar, and F. von Henke, Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, 1995. doi:10.1109/32.345827
60. S. Garland, N. A. Lynch, and M. Vaziri, IOA: A Language for Specifying, Programming, and Validating Distributed Systems. MIT Laboratory for Computer Science, Cambridge, MA, 2001. Available: http://theory.lcs.mit.edu/tds/ioa.html.
61. D. Kaynar, N. A. Lynch, R. Segala, and F. W. Vaandrager, The theory of timed I/O automata, Technical Report MIT-LCS-TR-917a. MIT Laboratory for Computer Science, Cambridge, MA, 2004. Available: http://theory.csail.mit.edu/ tds/reflist.html.
62. B. Gebremichael and F.W. Vaandrager, Specifying urgency in timed I/O automata. In Proc. 3rd IEEE Int. Conf. Software Engineering and Formal Methods (SEFM 2005), Koblenz, Germany, September 5-9, 2005. IEEE Computer Soc. Press, Los Alamitos, CA, pp. 64-73, 2005.