Modularity for timed and hybrid systems

R. Alur, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997, pp. 74–88.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
Series Title
LNCS
Abstract
In a trace-based world, the modular specification, verification, and control of live systems require each module to be receptive; that is, each module must be able to meet its liveness assumptions no matter how the other modules behave. In a real-time world, liveness is automatically present in the form of diverging time. The receptiveness condition, then, translates to the requirement that a module must be able to let time diverge no matter how the environment behaves. We study the receptiveness condition for real-time systems by extending the model of reactive modules to timed and hybrid modules. We define the receptiveness of such a module as the existence of a winning strategy in a game of the module against its environment. By solving the game on region graphs, we present an (optimal) Exptime algorithm for checking the receptiveness of prepositional timed modules. By giving a fixpoint characterization of the game, we present a symbolic procedure for checking the receptiveness of linear hybrid modules. Finally, we present an assume-guarantee principle for reasoning about timed and hybrid modules, and a method for synthesizing receptive controllers of timed and hybrid modules.
Publishing Year
Date Published
1997-01-01
Acknowledgement
This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the SRC contract 95-DC-324.036.
Volume
1243
Page
74 - 88
Conference
CONCUR: Concurrency Theory
IST-REx-ID

Cite this

Alur R, Henzinger TA. Modularity for timed and hybrid systems. In: Vol 1243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1997:74-88. doi:10.1007/3-540-63141-0_6
Alur, R., & Henzinger, T. A. (1997). Modularity for timed and hybrid systems (Vol. 1243, pp. 74–88). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-63141-0_6
Alur, Rajeev, and Thomas A Henzinger. “Modularity for Timed and Hybrid Systems,” 1243:74–88. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997. https://doi.org/10.1007/3-540-63141-0_6.
R. Alur and T. A. Henzinger, “Modularity for timed and hybrid systems,” presented at the CONCUR: Concurrency Theory, 1997, vol. 1243, pp. 74–88.
Alur R, Henzinger TA. 1997. Modularity for timed and hybrid systems. CONCUR: Concurrency Theory, LNCS, vol. 1243. 74–88.
Alur, Rajeev, and Thomas A. Henzinger. Modularity for Timed and Hybrid Systems. Vol. 1243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997, pp. 74–88, doi:10.1007/3-540-63141-0_6.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar