conference paper published yes Rajeev Alur author Thomas A Henzinger author 40876CD8-F248-11E8-B48F-1D18A9856A870000−0002−2985−7724 CONCUR: Concurrency Theory 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. Schloss Dagstuhl - Leibniz-Zentrum für Informatik1997Warsaw, Poland eng 978354069188410.1007/3-540-63141-0_6 124374 - 88 yes R. Alur and T. A. Henzinger, “Modularity for timed and hybrid systems,” in <i>8th International Conference on Concurrency Theory</i>, Warsaw, Poland, 1997, vol. 1243, pp. 74–88. Alur R, Henzinger TA. Modularity for timed and hybrid systems. In: <i>8th International Conference on Concurrency Theory</i>. Vol 1243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1997:74-88. doi:<a href="https://doi.org/10.1007/3-540-63141-0_6">10.1007/3-540-63141-0_6</a> Alur, Rajeev, and Thomas A. Henzinger. “Modularity for Timed and Hybrid Systems.” <i>8th International Conference on Concurrency Theory</i>, vol. 1243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997, pp. 74–88, doi:<a href="https://doi.org/10.1007/3-540-63141-0_6">10.1007/3-540-63141-0_6</a>. R. Alur, T.A. Henzinger, in:, 8th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997, pp. 74–88. Alur R, Henzinger TA. 1997. Modularity for timed and hybrid systems. 8th International Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 1243, 74–88. Alur, Rajeev, and Thomas A Henzinger. “Modularity for Timed and Hybrid Systems.” In <i>8th International Conference on Concurrency Theory</i>, 1243:74–88. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997. <a href="https://doi.org/10.1007/3-540-63141-0_6">https://doi.org/10.1007/3-540-63141-0_6</a>. Alur, R., &#38; Henzinger, T. A. (1997). Modularity for timed and hybrid systems. In <i>8th International Conference on Concurrency Theory</i> (Vol. 1243, pp. 74–88). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.1007/3-540-63141-0_6">https://doi.org/10.1007/3-540-63141-0_6</a> 45832018-12-11T12:09:36Z2022-08-17T08:47:55Z