Abstract
The framework of Hybrid automata—introduced by Alur, Courcourbetis, Henzinger, and Ho—provides a formal modeling and analysis environment to analyze the interaction between the discrete and the continuous parts of hybrid systems. Hybrid automata can be considered as generalizations of finite state automata augmented with a finite set of real-valued variables whose dynamics in each state is governed by a system of ordinary differential equations. Moreover, the discrete transitions of hybrid automata are guarded by constraints over the values of these real-valued variables, and enable discontinuous jumps in the evolution of these variables. Singular hybrid automata are a subclass of hybrid automata where dynamics is specified by state-dependent constant vectors. Henzinger, Kopke, Puri, and Varaiya showed that for even very restricted subclasses of singular hybrid automata, the fundamental verification questions, like reachability and schedulability, are undecidable. Recently, Alur, Wojtczak, and Trivedi studied an interesting class of hybrid systems, called constant-rate multi-mode systems, where schedulability and reachability analysis can be performed in polynomial time. Inspired by the definition of constant-rate multi-mode systems, in this paper we introduce weak singular hybrid automata (WSHA), a previously unexplored subclass of singular hybrid automata, and show the decidability (and the exact complexity) of various verification questions for this class including reachability (NP-Complete) and LTL model-checking (Pspace-Complete). We further show that extending WSHA with a single unrestricted clock or with unrestricted variable updates lead to undecidability of reachability problem.
This work was partly supported by the DST-CNRS project AVeRTS.
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., Henzinger, T.A., Ho, P.-S.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Hybrid Systems, pp. 209–229 (1992)
Alur, R., Dill, D.: A theory of timed automata. TCS 126(2), 183–235 (1994)
Alur, R., Forejt, V., Moarref, S., Trivedi, A.: Safe schedulability of bounded-rate multi-mode systems. In: HSCC, pp. 243–252 (2013)
Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181–203 (1994)
Alur, R., Trivedi, A., Wojtczak, D.: Optimal scheduling for constant-rate multi-mode systems. In: HSCC, pp. 75–84 (2012)
Asarin, E., Maler, O.: Achilles and the tortoise climbing up the arithmetical hierarchy. Journal of Computer and System Sciences 57(3), 389–398 (1998)
Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical systems having piecewise-constant derivatives. TCS 138, 35–66 (1995)
Baier, C., Katoen, J.P.: Principles of model checking. MIT Press (2008)
Čerāns, K.: Algorithmic problems in analysis of real time system specifications. PhD thesis (1992)
Fearnley, J., Jurdziński, M.: Reachability in two-clock timed automata is PSPACE-complete. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 212–223. Springer, Heidelberg (2013)
Henzinger, T.A., Kopke, P.W.: Discrete-time control for rectangular hybrid automata. TCS 221(1-2), 369–392 (1999)
Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? Journal of Comp. and Sys. Sciences 57, 94–124 (1998)
Jones, N.D., Lien, Y.E., Laaser, W.T.: New problems complete for nondeterministic log space. Mathematical Systems Theory 10(1), 1–17 (1976)
Krishna, S.N., Mathur, U., Trivedi, A.: Weak singular hybrid automata (2014), http://arxiv.org/abs/1311.3826
Laroussinie, F., Markey, N., Schnoebelen, P.: Model checking timed automata with one or two clocks. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 387–401. Springer, Heidelberg (2004)
Markey, N.: Verification of Embedded Systems – Algorithms and Complexity. Mémoire d’habilitation, ENS Cachan, France (April 2011)
Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall (1967)
Perrin, D., Pin, J.E.: Infinite Words—Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol. 141. Elsevier (2004)
Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733–749 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Krishna, S.N., Mathur, U., Trivedi, A. (2014). Weak Singular Hybrid Automata. In: Legay, A., Bozga, M. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2014. Lecture Notes in Computer Science, vol 8711. Springer, Cham. https://doi.org/10.1007/978-3-319-10512-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-10512-3_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10511-6
Online ISBN: 978-3-319-10512-3
eBook Packages: Computer ScienceComputer Science (R0)