{"date_updated":"2023-05-08T10:20:19Z","doi":"10.1007/3-540-44685-0_38","quality_controlled":"1","day":"13","acknowledgement":"This research was supported in part by the SRC contract 99-TJ-683.003, the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, the AFOSR MURI grant F49620-00-1-0327, and the NSF Theory grant CCR-9988172.","citation":{"mla":"De Alfaro, Luca, et al. “The Control of Synchronous Systems, Part II.” <i>Proceedings of the 12th International Conference on on Concurrency Theory</i>, vol. 2154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 566–81, doi:<a href=\"https://doi.org/10.1007/3-540-44685-0_38\">10.1007/3-540-44685-0_38</a>.","ista":"De Alfaro L, Henzinger TA, Mang F. 2001. The control of synchronous systems, Part II. Proceedings of the 12th International Conference on on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2154, 566–581.","chicago":"De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “The Control of Synchronous Systems, Part II.” In <i>Proceedings of the 12th International Conference on on Concurrency Theory</i>, 2154:566–81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001. <a href=\"https://doi.org/10.1007/3-540-44685-0_38\">https://doi.org/10.1007/3-540-44685-0_38</a>.","ama":"De Alfaro L, Henzinger TA, Mang F. The control of synchronous systems, Part II. In: <i>Proceedings of the 12th International Conference on on Concurrency Theory</i>. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:566-581. doi:<a href=\"https://doi.org/10.1007/3-540-44685-0_38\">10.1007/3-540-44685-0_38</a>","ieee":"L. De Alfaro, T. A. Henzinger, and F. Mang, “The control of synchronous systems, Part II,” in <i>Proceedings of the 12th International Conference on on Concurrency Theory</i>, Aalborg, Denmark, 2001, vol. 2154, pp. 566–581.","apa":"De Alfaro, L., Henzinger, T. A., &#38; Mang, F. (2001). The control of synchronous systems, Part II. In <i>Proceedings of the 12th International Conference on on Concurrency Theory</i> (Vol. 2154, pp. 566–581). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/3-540-44685-0_38\">https://doi.org/10.1007/3-540-44685-0_38</a>","short":"L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 12th International Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 566–581."},"volume":2154,"_id":"4634","year":"2001","scopus_import":"1","publist_id":"74","publication_identifier":{"isbn":["9783540424970"]},"author":[{"first_name":"Luca","last_name":"De Alfaro","full_name":"De Alfaro, Luca"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Freddy","full_name":"Mang, Freddy","last_name":"Mang"}],"alternative_title":["LNCS"],"month":"08","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"The control of synchronous systems, Part II","publication":"Proceedings of the 12th International Conference on on Concurrency Theory","extern":"1","conference":{"start_date":"2001-08-20","end_date":"2001-08-25","name":"CONCUR: Concurrency Theory","location":"Aalborg, Denmark"},"date_created":"2018-12-11T12:09:52Z","oa_version":"None","language":[{"iso":"eng"}],"page":"566 - 581","publication_status":"published","type":"conference","date_published":"2001-08-13T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"lang":"eng","text":"A controller is an environment for a system that achieves a particular control objective by providing inputs to the system without constraining the choices of the system. For synchronous systems, where system and controller make simultaneous and interdependent choices, the notion that a controller must not constrain the choices of the system can be formalized by type systems for composability. In a previous paper, we solved the control problem for static and dynamic types: a static type is a dependency relation between inputs and outputs, and composition is well-typed if it does not introduce cyclic dependencies; a dynamic type is a set of static types, one for each state. Static and dynamic types, however, cannot capture many important digital circuits, such as gated clocks, bidirectional buses, and random-access memory. We therefore introduce more general type systems, so-called dependent and bidirectional types, for modeling these situations, and we solve the corresponding control problems.\r\nIn a system with a dependent type, the dependencies between inputs and outputs are determined gradually through a game of the system against the controller. In a system with a bidirectional type, also the distinction between inputs and outputs is resolved dynamically by such a game. The game proceeds in several rounds. In each round the system and the controller choose to update some variables dependent on variables that have already been updated. The solution of the control problem for dependent and bidirectional types is based on algorithms for solving these games."}],"article_processing_charge":"No","intvolume":"      2154","status":"public"}