Decomposing verification of timed I/O automata

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

Volumn 3253, Issue , 2004, Pages 84-101

  Kaynar, Dilsun Kirli ^a   Lynch, Nancy ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MODEL CHECKING; SPECIFICATIONS; TIME SHARING SYSTEMS;

AUTOMATON MODEL; LIVENESS PROPERTIES; NEW RESULTS; PROOF OBLIGATIONS; SAFETY PROPERTY; SYSTEM SPECIFICATION; VERIFICATION TASK;

REAL TIME SYSTEMS;

EID: 35048830505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30206-3_8     Document Type: Article

References (14)

1. [AH97] R. Alur and T. Henzinger. Modularity for timed and hybrid systems. In Proceedings of the 8th International Conference on Concurrency Theory (CONCUR), volume 1243 of LNCS, pages 74-88. Springer-Verlag, 1997.
2. [AK96] R. Alur and R. P. Kurshan. Timing analysis in COSPAN. In Hybrid Systems III: Verification and Control. Springer-Verlag, 1996.
3. [AL93] M. Abadi and L. Lamport. Composing specifications. A CM Transactions on Programming Languages and Systems, 1(15):73-132, 1993.
4. [AL94] Martin Abadi and Leslie Lamport. An old-fashioned recipe for real time. ACM Transactions on Programming Languages and Systems, 16(5):1543-1571, 1994.
5. [AL95] M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507-534, 1995.
6. [HQR00] T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Decomposing refinement proofs using assume-guarantee reasoning. In Proceedings of the International Conference on Computer-Aided Design (ICCAD), pages 245-252. IEEE Computer Society Press, 2000.
7. [HQR02] T. Henzinger, S. Qadeer, and S. K. Rajamani. An assume-guarantee rule for checking simulation. ACM Transactions on Programming Languages and Systems, 24:51-64, 2002.
8. [Jon83] G. B. Jones. Specification and design of parallel programs. In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 321-332. North-Holland, 1983.
9. [KLSV03a] D. Kaynar, N. Lynch, R. Segala, and F. Vaandrager. The theory of timed I/O automata. Technical Report MIT/LCS/TR-917, MIT Laboratory for Computer Science, 2003. Available at http://theory.lcs.mit.edu/tds/reflist.html.
10. [KLSV03b] D. Kaynar, N. Lynch, R. Segala, and F. Vaandrager. Timed I/O automata: A mathematical framework for modeling and analyzing real-time systems. In Proceedings of the 24th IEEE International Real-Time Systems Symposium, pages 166-177, Cancun, Mexico, 2003. IEEE Computer Society. Full version available as Technical Report MIT/LCS/TR-917.
11. [MWLF03] S. Mitra, Y. Wang, N. Lynch, and E. Feron. Safety verification of pitch controller for model helicopter. In O. Maler and A. Pnueli, editors, Proc. of Hybrid Systems: Computation and Control, volume 2623 of Lecture Notes in Computer Science, pages 343-358, Prague, the Czech Republic April 3-5, 2003.
12. [Pnu84] A. Pnueli. In transition from global to modular temporal reasoning about programs. In K. R. Apt, editor, Logis and Models of Concurret Systems, NATO ASI, pages 123-144. Springer-Verlag, 1984.
13. [Sta85] E. W. Stark. A proof technique for rely/guarantee properties. In S. N. Maheshwari, editor, Foundations of Software Technology and Theoretical Computer Science, volume 206 of LNCS, pages 369-391. Springer-Verlag, 1985.
14. [TAKB96] S. Tasiran, R. Alur, R.P. Kurshan, and R.K. Brayton. Verifying abstractions of timed systems. In Proceedings of the Seventh Conference on Concurrency Theory (CONCUR), volume 1119 of LNCS, 1996.