Succinct discrete time approximations of distributed hybrid automata
Pages 1 - 10
Abstract
We consider a network of hybrid automata that observe and control a plant whose state space is determined by a finite set of continuous variables. We assume that at any instant, these variables are evolving at (possibly different) constant rates. Each automaton in the network controls-i.e. can switch the rates of-a designated subset of the continuous variables without having to reset their values. These mode changes are determined by the current values of a designated subset of the variables that the automaton can observe. We require the variables controlled-in terms of effecting mode changes - by different hybrid automata to be disjoint. However, the same variable may be observed by more than one automaton. We study the discrete time behavior of such networks of hybrid automata. We show that the set of global control state sequences displayed by the network is regular. More importantly, we show that one can effectively and succinctly represent this regular language as a product of local finite state automata.
References
[1]
M. Agrawal and P.S. Thiagarajan. Lazy rectangular hybrid automata. In 7th HSCC, LNCS 2993, pages 1--15. Springer, 2004.
[2]
M. Agrawal and P.S. Thiagarajan. The discrete time behaviour of lazy linear hybrid automata. In 8th HSCC, LNCS 3414, pages 55--69. Springer, 2005.
[3]
R. Alur, T.A. Henzinger, G. Lafferriere, and G.J. Pappas. Discrete abstractions of hybrid systems. Proc. of the IEEE, 88:971--984, 2000.
[4]
E. Asarin, O. Bournez, T. Dang, and O. Maler. Reachability analysis of piecewise-linear dynamical systems. In HSCC 2000, LNCS 1790, pages 20--31. Springer, 2000.
[5]
P. Caspi, A. Curic, A. Maignan, C. Sofronis, S. Tripakis, and P. Niebert. From Simulink to SCADE/Lustre to TTA: a layered approach for distributed embedded applications. In Proc. of LCTES'03, 2003.
[6]
O. Clarke, E.M. Grumberg and D.A. Peled. Model Checking. MIT Press, 1999.
[7]
F. Commoner, A.W. Holt, S. Even, and A. Pnueli. Marked directed graphs. J. Computer and System Sciences, 5:511--523, 1971.
[8]
V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, 1995.
[9]
M.C.F. Donkers, L. Hetel, W.P.M.H. Heemels, N. van de Wouw, and M. Steinbuch. Stability analysis of networked control systems using a switched linear systems approach. In HSCC 2009, LNCS 5469, pages 150--164, 2009.
[10]
J. Esparza and K. Heljanko. Unfoldings-A Partial-Order Approach to Model Checking. Springer, 2008. EATCS Monographs in Theoretical Computer Science.
[11]
P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems-An Approach to the State-Explosion Problem. Springer, 1996. LNCS 1032.
[12]
T.A. Henzinger. Hybrid automata with finite bisimulations. In 22nd ICALP, LNCS 944, pages 324--335. Springer, 1995.
[13]
T.A. Henzinger. The theory of hybrid automata. In 11th LICS, pages 278--292. IEEE Press, 1996.
[14]
T.A. Henzinger and P.W. Kopke. Discrete-time control for rectangular hybrid automata. Theoretical Comp. Sci., 221:369--392, 1999.
[15]
T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? J. of Comp. and Sys. Sci., 57:94--124, 1998.
[16]
J. Hespanha, P. Naghshtabrizi, and Y. Xu. A survey of recent results in networked control systems. Proc. of the IEEE, 95(1):138--162, 2007.
[17]
S. Tripakis. Decentralized control of discrete event systems with bounded or unbounded delay communication. IEEE Trans. on Automatic Control, 49(9):1489--1501, 2004.
Index Terms
- Succinct discrete time approximations of distributed hybrid automata
Recommendations
Modular discrete time approximations of distributed hybrid automata
We consider a network of controllers that observe and control a plant whose dynamics is determined by a finite set of continuous variables. At any given time a variable evolves at a constant rate. However, a controller can switch the rates of a ...
Improved Constructions for Succinct Affine Automata
Descriptional Complexity of Formal SystemsAbstractAffine finite automata (AfAs) can be more succinct than probabilistic and quantum finite automata when recognizing some regular languages with bounded error. In this paper, we improve previously known succinct AFA constructions in three ways. ...
Succinct description of regular languages by weak restarting automata
The descriptional complexity of restarting automata is investigated. We distinguish the classes of weak restarting automata, i.e., classical restarting automata accepting exactly the regular languages. In order to investigate the descriptional power ...
Comments
Information & Contributors
Information
Published In
April 2010
308 pages
Copyright © 2010 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 12 April 2010
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
HSCC '10
Sponsor:
HSCC '10: The 13th ACM International Conference on Hybrid Systems: Computation and Control
April 12 - 15, 2010
Stockholm, Sweden
Acceptance Rates
Overall Acceptance Rate 153 of 373 submissions, 41%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 178Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in