Weak Singular Hybrid Automata

详细信息    查看全文

• 作者：Shankara Narayanan Krishna (17)
  Umang Mathur (17)
  Ashutosh Trivedi (17)
  
• 刊名：Lecture Notes in Computer Science
• 出版年：2014
• 出版时间：2014
• 年：2014
• 卷：8711
• 期：1
• 页码：161-175
• 全文大小：272 KB
• 参考文献：1. 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-29 (1992)
  2. Alur, R., Dill, D.: A theory of timed automata. TCS?126(2), 183-35 (1994) CrossRef
  3. Alur, R., Forejt, V., Moarref, S., Trivedi, A.: Safe schedulability of bounded-rate multi-mode systems. In: HSCC, pp. 243-52 (2013)
  4. Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM?41(1), 181-03 (1994) CrossRef
  5. Alur, R., Trivedi, A., Wojtczak, D.: Optimal scheduling for constant-rate multi-mode systems. In: HSCC, pp. 75-4 (2012)
  6. Asarin, E., Maler, O.: Achilles and the tortoise climbing up the arithmetical hierarchy. Journal of Computer and System Sciences?57(3), 389-98 (1998) CrossRef
  7. Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical systems having piecewise-constant derivatives. TCS?138, 35-6 (1995) CrossRef
  8. Baier, C., Katoen, J.P.: Principles of model checking. MIT Press (2008)
  9. ?erāns, K.: Algorithmic problems in analysis of real time system specifications. PhD thesis (1992)
  10. 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-23. Springer, Heidelberg (2013) CrossRef
  11. Henzinger, T.A., Kopke, P.W.: Discrete-time control for rectangular hybrid automata. TCS?221(1-2), 369-92 (1999) CrossRef
  12. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? Journal of Comp. and Sys. Sciences?57, 94-24 (1998) CrossRef
  13. Jones, N.D., Lien, Y.E., Laaser, W.T.: New problems complete for nondeterministic log space. Mathematical Systems Theory?10(1), 1-7 (1976) CrossRef
  14. Krishna, S.N., Mathur, U., Trivedi, A.: Weak singular hybrid automata (2014), http://arxiv.org/abs/1311.3826
  15. 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-01. Springer, Heidelberg (2004) CrossRef
  16. Markey, N.: Verification of Embedded Systems -Algorithms and Complexity. Mémoire d’habilitation, ENS Cachan, France (April 2011)
  17. Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall (1967)
  18. Perrin, D., Pin, J.E.: Infinite Words—Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol.?141. Elsevier (2004)
  19. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM?32(3), 733-49 (1985) CrossRef
  
• 作者单位：Shankara Narayanan Krishna (17)
  Umang Mathur (17)
  Ashutosh Trivedi (17)
  
  17. Department of Computer Science and Engineering, Indian Institute of Technology - Bombay, Mumbai, 400076, India
  
• ISSN：1611-3349

文摘

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.