Abstract
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that systems are frequently designed and verified in a modular approach, it is desirable that this relationship is compositional, which is not the case for hybrid systems in general. We identify subclasses of linear hybrid automata that are compositional with respect to timed, respectively weak timed simulation.
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.
References
Henzinger, T.A., Pei-Hsin, H., Wong-Toi, H.: Algorithmic analysis of nonlinear hybrid systems. IEEE Trans. Automatic Control 43(4), 540–554 (1998)
Frehse, G.: PHAVer: Algorithmic verification of hybrid systems past HyTech. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 258–273. Springer, Heidelberg (2005), PHAVer is available at: http://www.cs.ru.nl/~goranf/
Doyen, L., Henzinger, T.A., Raskin, J.-F.: Automatic rectangular refinement of affine hybrid systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 144–161. Springer, Heidelberg (2005)
Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Pei-Hsin, H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theor. Comp. Science 138(1), 3–34 (1995)
Ábrahám-Mumm, E., Hannemann, U., Steffen, M.: Verification of hybrid systems: Formalization and proof rules in PVS. In: Proc. IEEE Int. Conf. on Engineering of Complex Computer Systems (ICECCS 2001) (June 2001)
Lynch, N.A., Segala, R., Vaandrager, F.W.: Hybrid I/O automata. Information and Computation 185(1), 105–157 (2003)
Henzinger, T.A.: The theory of hybrid automata. In: Proc. 11th Annual IEEE Symposium on Logic in Computer Science, LICS 1996, New Brunswick, New Jersey, July 27-30, 1996, pp. 278–292. IEEE Computer Society Press, Los Alamitos (1996)
Frehse, G., Han, Z., Krogh, B.H.: Assume-guarantee reasoning for hybrid i/o-automata by over-approximation of continuous interaction. In: Proc. IEEE Conf. Decision & Control (CDC 2004), Atl., Bahamas, December 14–17 (2004)
Frehse, G.: Compositional verification of hybrid systems with discrete interaction using simulation relations. In: Proc. IEEE Conf. Computer-Aided Control System Design (CACSD 2004), Taipei, Taiwan, September 1-4 (2004)
Frehse, G.: Compositional Verification of Hybrid Systems using Simulation Relations. PhD thesis, Radboud Universiteit Nijmegen (October 2005)
Lynch, N.A., Fischer, M.J.: On describing the behavior and implementation of distributed systems. Theoretical Computer Science 13(1), 17–43 (1981); Special issue on Semantics of Concurrent Computation
Alur, R., Henzinger, T.A., Pei-Hsin, H.: Automatic symbolic verification of embedded systems. IEEE Trans. Soft. Engineering 22, 181–201 (1996)
Henzinger, T.A., Wong-Toi, H.: Linear phase-portrait approximations for nonlinear hybrid systems. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol. 1066, pp. 377–388. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frehse, G. (2006). On Timed Simulation Relations for Hybrid Systems and Compositionality. In: Asarin, E., Bouyer, P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2006. Lecture Notes in Computer Science, vol 4202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11867340_15
Download citation
DOI: https://doi.org/10.1007/11867340_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45026-9
Online ISBN: 978-3-540-45031-3
eBook Packages: Computer ScienceComputer Science (R0)