Abstract
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verification of systems where the implementation and the specification are represented as timed I/O automata. We first present a theorem that is applicable in verification tasks in which system specifications express safety properties. This theorem has an interesting corollary that involves the use of auxiliary automata in simplifying the proof obligations. We then derive a new result that shows how the same technique can be applied to the case where system specifications express liveness properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alur, R., Henzinger, T.: Modularity for timed and hybrid systems. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 74–88. Springer, Heidelberg (1997)
Alur, R., Kurshan, R.P.: Timing analysis in COSPAN. In: Hybrid Systems III: Verification and Control, Springer, Heidelberg (1996)
Abadi, M., Lamport, L.: Composing specifications. ACM Transactions on Programming Languages and Systems 1(15), 73–132 (1993)
Abadi, M., Lamport, L.: An old-fashioned recipe for real time. ACM Transactions on Programming Languages and Systems 16(5), 1543–1571 (1994)
Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages and Systems 17(3), 507–534 (1995)
Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Decomposing refinement proofs using assume-guarantee reasoning. In: Proceedings of the International Conference on Computer-Aided Design (ICCAD), pp. 245–252. IEEE Computer Society Press, Los Alamitos (2000)
Henzinger, T., Qadeer, S., Rajamani, S.K.: An assume-guarantee rule for checking simulation. ACM Transactions on Programming Languages and Systems 24, 51–64 (2002)
Jones, C.B.: Specification and design of parallel programs. In: Mason, R.E.A. (ed.) Information Processing 1983: Proceedings of the IFIP 9th World Congress, pp. 321–332. North-Holland, Amsterdam (1983)
Kaynar, D., Lynch, N., Segala, R., Vaandrager, F.: 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
Kaynar, D., Lynch, N., Segala, R., Vaandrager, F.: 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, Cancun, Mexico, 2003, pp. 166–177. IEEE Computer Society, Los Alamitos (2003); Full version available as Technical Report MIT/LCS/TR-917
Mitra, S., Wang, Y., Lynch, N., Feron, E.: Safety verification of pitch controller for model helicopter. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 343–358. Springer, Heidelberg (2003)
Pnueli, A.: In transition from global to modular temporal reasoning about programs. In: Apt, K.R. (ed.) Logis and Models of Concurret Systems, NATO ASI, pp. 123–144. Springer, Heidelberg (1984)
Stark, E.W.: A proof technique for rely/guarantee properties. In: Maheshwari, S.N. (ed.) FSTTCS 1985. LNCS, vol. 206, pp. 369–391. Springer, Heidelberg (1985)
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaynar, D.K., Lynch, N. (2004). Decomposing Verification of Timed I/O Automata. In: Lakhnech, Y., Yovine, S. (eds) Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems. FTRTFT FORMATS 2004 2004. Lecture Notes in Computer Science, vol 3253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30206-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-30206-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23167-7
Online ISBN: 978-3-540-30206-3
eBook Packages: Springer Book Archive