{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:21:17Z","timestamp":1771485677574,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540009139","type":"print"},{"value":"9783540365808","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36580-x_32","type":"book-chapter","created":{"date-parts":[[2007,12,9]],"date-time":"2007-12-09T12:13:36Z","timestamp":1197202416000},"page":"435-449","source":"Crossref","is-referenced-by-count":24,"title":["The \u00d6-Calculus: A Language for Distributed Control of Reconfigurable Embedded Systems"],"prefix":"10.1007","author":[{"given":"William C.","family":"Rounds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hosung","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"32_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-45351-2_7","volume-title":"Hybrid Systems, Computation, and Control","author":"R. Alur","year":"2001","unstructured":"R. Alur, R. Grosu, I. Lee, and O. Sokolsky. Compositional refinement for hierarchical hybrid systems. In Maria Domenica Di Benedetto and Alberto Sangiovanni-Vincentelli, editors, Hybrid Systems, Computation, and Control, pages 33\u201348. Springer-Verlag, 2001. Volume 2034 of Lecture Notes in Computer Science."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"R. Alur and. T. A. Henzinger. Reactive modules. Formal methods in System Design, 15:7\u201348, 1999.","journal-title":"Formal methods in System Design"},{"issue":"3","key":"32_CR3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. D. Brookes","year":"1984","unstructured":"S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. J. Assoc. Comput. Mach., 31(3):560\u2013599, 1984.","journal-title":"J. Assoc. Comput. Mach."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Luis Caires and Luca Cardelli. A spatial logic for concurrency (part i). In Proceedings, Theoretical Aspects of Computer Software; 4th International Symposium, Sendai, Japan, 2001. To appear in I & C special issue on TACS\u201901.","DOI":"10.1007\/3-540-45500-0_1"},{"key":"32_CR5","unstructured":"A. Deshpande, A. Gollu, and L. Semenzato. The shift programming language and run-time system for dynamic networks of hybrid automata. Technical report, California PATH Research Report UCB-ITS-PRR-97-7, 1997."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"T. A. Henzinger. The theory of hybrid automata. In Proc. 11th Annual Symposium on Logic in Computer Science, pages 278\u2013292, 1996.","DOI":"10.1109\/LICS.1996.561342"},{"key":"32_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45351-2_24","volume-title":"Hybrid Systems, Computation, and Control","author":"T. A. Henzinger","year":"2001","unstructured":"T. A. Henzinger, M. Minea, and V. Prabhu. Assume-guarantee reasoning for hierarchical hybrid systems. In Maria Domenica Di Benedetto and Alberto Sangiovanni-Vincentelli, editors, Hybrid Systems, Computation, and Control, pages 275\u2013290. Springer-Verlag, 2001. Volume 2034 of Lecture Notes in Computer Science."},{"key":"32_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-46430-1_17","volume-title":"Hybrid Systems: Computation and Control","author":"E. Klavins","year":"2000","unstructured":"E. Klavins. Automatic compilation of concurrent hybrid factories from product assembly specifications. In Hybrid Systems: Computation and Control, LNCS 1790, pages 174\u2013187, Pittsburgh, PA, 2000. Springer-Verlag."},{"key":"32_CR9","unstructured":"Eric Klavins and Daniel Koditschek. A formalism for the composition of loosely coupled robot behaviors. Technical report, University of Michigan CSE Tech Report CSE-TR-12-99, 1999."},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/0196-8858(90)90017-S","volume":"11","author":"D. E. Koditschek","year":"1990","unstructured":"Daniel E. Koditschek and Elon Rimon. Robot navigation functions on manifolds with boundary. Advances in Applied Mathematics, 11:412\u2013442, 1990.","journal-title":"Advances in Applied Mathematics"},{"key":"32_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/3-540-45351-2_33","volume-title":"Hybrid Systems: Computation and Control","author":"N. Lynch","year":"2001","unstructured":"Nancy Lynch, Roberto Segala, and Frits Vaandrager. Hybrid i\/o automata revisited. In Maria Domenica Di Benedetto and Alberto Sangiovanni-Vincentelli, editors, Hybrid Systems: Computation and Control. Fourth International Workshop, pages 403\u2013417. Springer-Verlag, 2001. Volume 2034 of Lecture Notes in Computer Science."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Nancy Lynch and Mark Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of 6th Annual Symposium on Principles of Distributed Computing, pages 137\u2013151, 1987.","DOI":"10.1145\/41840.41852"},{"key":"32_CR13","unstructured":"Robin Milner. Communicating and Mobile Systems: the \u03c0-calculus. Cambridge University Press, 1999."},{"key":"32_CR14","unstructured":"W. C. Rounds and Hosung Song. The \u00f6-calculus-a hybrid extension of the \u03c0-calculus to embedded systems. Technical report, University of Michigan EECSCSE Tech Report CSE-TR-458-02, 2002."},{"key":"32_CR15","unstructured":"Steve Schneider. Concurrent and real-time systems: the CSP approach. Wiley, 2000."},{"key":"32_CR16","unstructured":"Roberto Segala. A process-algebraic view of i-o automata. Technical report, MIT Tech Memo MIT\/LCS\/TR557, 1992."}],"container-title":["Lecture Notes in Computer Science","Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36580-X_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T20:16:26Z","timestamp":1557087386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36580-X_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009139","9783540365808"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36580-x_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}