Abstract
We introduce STORMED hybrid systems, a decidable class of hybrid systems which is similar to o-minimal hybrid automata in that the continuous dynamics and constraints are described in an o-minimal theory. However, unlike o-minimal hybrid automata, the variables are not initialized in a memoryless fashion at discrete steps. STORMED hybrid systems require flows which are monotonic with respect to some vector in the continuous space and can be characterised as bounded-horizon systems in terms of their discrete transitions. We demonstrate that such systems admit a finite bisimulation, which can be effectively constructed provided the o-minimal theory used to describe the system is decidable. As a consequence, many verification problems for such systems have effective decision algorithms.
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
Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Computer Science 138(1), 3–34 (1995)
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science 138(1), 35–65 (1995)
Blondel, V.D., Bournez, O., Koiran, P., Papadimitriou, C.H., Tsitsiklis, J.N.: Deciding stability and mortality of piecewise affine dynamical systems. Theoretical Computer Science 255(1–2), 687–696 (2001)
Bouyer, P., Brihaye, T., Chevalier, F.: Weighted o-minimal hybrid systems are more decidable than weighted timed automata? In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 69–83. Springer, Heidelberg (2007)
Brihaye, T.: Verification and control of o-minimal hybrid systems and weighted timed automata. PhD thesis, Academie Universitaire Wallonie-Bruxelles (2006)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)
Asarin, E., Schneider, G., Yovine, S.: Algorithmic analysis of polygonal hybrid systems, part i: Reachability. Theor. Comput. Sci. 379(1-2), 231–265 (2007)
Gentilini, R.: Reachability Problems on Extended O-minimal Hybrid Automata. Lecture Notes in Compute Sceience, vol. 3829/2006, pp. 162–176. Springer, Heidelberg (2005)
Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? In: Proc. 27th Annual ACM Symp. on Theory of Computing (STOC), pp. 373–382 (1995)
Lafferriere, G., Pappas, G., Sastry, S.: O-minimal hybrid systems (1998)
Milner, R.: Communication and Concurrency. Prentice-Hall, Inc., Englewood Cliffs (1989)
Mysore, V., Pnueli, A.: Refining the undecidability frontier of hybrid automata. In: Proceedings of the International Conference on the Foundations of Software Technology and Theoretical Computer Science, pp. 261–272 (2005)
Prabhakar, P., Vladimerou, V., Viswanathan, M., Dullerud, G.: A decidable class of planar linear hybrid systems. Technical report, University of Illinois at Urbana-Champaign, UIUCDCS-R-2008-2927 (2008)
Tarski, A.: A Decision Method for Elementary Algebra and Geometry, 2nd edn. University of California Press (1951)
van den Dries, L., Mille, C.: On the real exponential field with restricted analytic functions. Israel Journal of Mathematics 85, 19–56 (1994)
van den Dries, L.: Tame Topology and O-minimal Structures. Cambridge Univesity Press, Cambridge (1998)
Vladimerou, V., Prabhakar, P., Viswanathan, M., Dullerud, G.: STORMED Hybrid Systems. Technical report, University of Illinois at Urbana-Champaign (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vladimerou, V., Prabhakar, P., Viswanathan, M., Dullerud, G. (2008). STORMED Hybrid Systems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70583-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-70583-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70582-6
Online ISBN: 978-3-540-70583-3
eBook Packages: Computer ScienceComputer Science (R0)