{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:03:41Z","timestamp":1776373421514,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540443070","type":"print"},{"value":"9783540458289","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45828-x_9","type":"book-chapter","created":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T13:59:11Z","timestamp":1190383151000},"page":"108-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":81,"title":["Timed Interfaces"],"prefix":"10.1007","author":[{"given":"Luca","family":"de Alfaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky. Semantics of interaction. In Trees in Algebra and Programming, volume 1059 of Lect. Notes in Comp. Sci., page 1. Springer, 1996.","DOI":"10.1007\/3-540-61064-2_24"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"R. Alur and T.A. Henzinger. Modularity for timed and hybrid systems. In Concurrency Theory, volume 1243 of Lect. Notes in Comp. Sci., pages 74\u201388. Springer, 1997.","DOI":"10.1007\/3-540-63141-0_6"},{"key":"9_CR4","unstructured":"E. Asarin, O. Maler, A. Pnueli, and J. Sifakis. Controller synthesis for timed automata. In Proc. IFAC Symp. System Structure and Control, pages 469\u2013474. Elsevier, 1998."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"S. Chaki, S.K. Rajamani, and J. Rehof. Types as models: Model checking message-passing programs. In Proc. Symp. Principles of Programming Languages, pages 45\u201357. ACM, 2002.","DOI":"10.1145\/565816.503278"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"L. de Alfaro and T.A. Henzinger. Interface automata. In Proc. Symp. Foundations of Software Engineering, pages 109\u2013120. ACM, 2001.","DOI":"10.1145\/503271.503226"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"L. de Alfaro and T.A. Henzinger. Interface theories for component-based design. In Embedded Software, volume 2211 of Lect. Notes in Comp. Sci., pages 148\u2013165. Springer, 2001.","DOI":"10.1007\/3-540-45449-7_11"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In Concurrency Theory, volume 2154 of Lect. Notes in Comp. Sci., pages 536\u2013550. Springer, 2001.","DOI":"10.1007\/3-540-44685-0_36"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"D.L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. MIT Press, 1988.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus, and determinacy. In Proc. Symp. Foundations of Computer Science, pages 368\u2013377. IEEE Computer Society, 1991.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"M. Merritt, F. Modugno, and M. Tuttle. Time constrained automata. In Concurrency Theory, volume 527 of Lect. Notes in Comp. Sci., pages 408\u2013423. Springer, 1991.","DOI":"10.1007\/3-540-54430-5_103"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In Theoretical Aspects of Computer Science, volume 900 of Lect. Notes in Comp. Sci., pages 229\u2013242. Springer, 1995.","DOI":"10.1007\/3-540-59042-0_76"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/0169-7552(95)00122-0","volume":"28","author":"E. Rudolph","year":"1996","unstructured":"E. Rudolph, P. Graubmann, and J. Gabowski. Tutorial on message sequence charts. Computer Networks and ISDN Systems-SDL and MSC, 28:1629\u20131641, 1996.","journal-title":"Computer Networks and ISDN Systems-SDL and MSC"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"S.K. Rajamani and J. Rehof. A behavioral module system for the pi-calculus. In Static Analysis Symposium, volume 2126 of Lect. Notes in Comp. Sci., pages 375\u2013394. Springer, 2001.","DOI":"10.1007\/3-540-47764-0_22"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/inco.1997.2671","volume":"141","author":"R. Segala","year":"1998","unstructured":"R. Segala, G. Gawlick, J. S\u00f8gaard-Andersen, and N. Lynch. Liveness in timed and untimed systems. Information and Computation, 141:119\u2013171, 1998.","journal-title":"Information and Computation"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, volume B, pages 135\u2013191. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Wang Yi. Real-time behaviour of asynchronous agents. In Concurrency Theory, volume 458 of Lect. Notes in Comp. Sci., pages 502\u2013520. Springer, 1990.","DOI":"10.1007\/BFb0039080"}],"container-title":["Lecture Notes in Computer Science","Embedded Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45828-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T04:14:30Z","timestamp":1737432870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45828-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443070","9783540458289"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45828-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"24 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}