{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:32:16Z","timestamp":1767652336962},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540550921"},{"type":"electronic","value":"9783540466925"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55092-5_32","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:28:16Z","timestamp":1330212496000},"page":"591-620","source":"Crossref","is-referenced-by-count":52,"title":["Timed and Hybrid Statecharts and their textual representation"],"prefix":"10.1007","author":[{"given":"Y.","family":"Kesten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Pnueli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking for real-time systems. In Proc. 5th IEEE Symp. Logic in Comp. Sci., 1990.","DOI":"10.1109\/LICS.1990.113766"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Lamport. An old-fashioned recipe for real time. In Real-Time: Theory in Practice. Lec. Notes in Comp. Sci., Springer-Verlag, 1991.","DOI":"10.1007\/BFb0031985"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"D. Drusinsky and D. Harel. On the power of bounded concurrency I: The finite automata level. submitted, 1989. (Preliminary version appeared as \u201cOn the Power of Cooperative Concurrency\u201d, in Proc. Intl. Conf. on Concurrency, Concurrency 88, Lec. Notes in Comp. Sci. 335, Springer, 1988, pp. 74\u2013103).","DOI":"10.1007\/3-540-50403-6_34"},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel. Statecharts: A visual formalism for complex systems. Sci. Comp. Prog., 8:231\u2013274, 1987.","journal-title":"Sci. Comp. Prog."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"D. Harel. A thesis for bounded concurrency. In Proc. 14th Symp. Math. Found. Comput. Sci., pages 35\u201348. Lec. Notes in Comp. Sci. 379, Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51486-4_55"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"C. Huizing, R. Gerth, and W.P. de Roever. Modelling statecharts behaviour in a fully abstract way. In Proc. 13th CAAP, pages 271\u2013294. Lecture Notes in Comp. Sci. 299, Springer-Verlag, 1988.","DOI":"10.1007\/BFb0026110"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"T. Hirst and D. Harel. On the power of bounded concurrency II: The pushdown automata level. In Proc. 15th Coll. Trees in Algebra and Programming. Lec. Notes in Comp. Sci., Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52590-4_37"},{"key":"32_CR8","unstructured":"D. Harel and H.A. Kahana. On statecharts with overlapping. Technical report, The Weizmann Institute, 1989."},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/32.54292","volume":"16","author":"D. Harel","year":"1990","unstructured":"D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, A. Shtull-Trauring, and M. Trakhtenbrot. Statemate: A working environment for the development of complex reactive systems. IEEE Trans. Software Engin., 16:403\u2013414, 1990.","journal-title":"IEEE Trans. Software Engin."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"T. Henzinger, Z. Manna, and A. Pnueli. An interleaving model for real time. In 5th Jerusalem Conference on Information Technology, pages 717\u2013730, 1990.","DOI":"10.21236\/ADA326062"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"T. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for real-time systems. In Proc. 18th ACM Symp. Princ. of Prog. Lang., pages 353\u2013366, 1991.","DOI":"10.1145\/99583.99629"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"D. Harel and A. Pnueli. On the development of reactive systems. In Logics and Models of Concurrent Systems, pages 477\u2013498. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82453-1_17"},{"key":"32_CR13","unstructured":"D. Harel, A. Pnueli, J.P. Schmidt, and R. Sherman. On the formal semantics of statecharts. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 54\u201364, 1986."},{"key":"32_CR14","unstructured":"C. Huizing. Semantics of reactive systems: comparison and full abstraction. PhD thesis, Technical University Eindhoven, 1991."},{"key":"32_CR15","unstructured":"F. Maraninchi. Argos: un langage graphique pour la conception, la description et la validation des syst\u00e8mes r\u00e9actifs. PhD thesis, University of Grenoble, 1990."},{"key":"32_CR16","unstructured":"F. Maraninchi. Languages for reactive systems: a common framework for comparing statecharts and argos. Technical report, LGI-IMAG Grenoble, 1991."},{"key":"32_CR17","volume-title":"Proceedings of the REX workshop \u201cReal-Time: Theory in Practice\u201d","author":"O. Maler","year":"1992","unstructured":"O. Maler, Z. Manna, and A. Pnueli. A formal approach to hybrid systems. In Proceedings of the REX workshop \u201cReal-Time: Theory in Practice\u201d, LNCS. Springer Verlag, New York, 1992."},{"key":"32_CR18","unstructured":"G. D. Plotkin. A structural approach to operational semantics. Technical report, Dept. of Comp. Sci., Arhus University, 1981."},{"key":"32_CR19","first-page":"373","volume-title":"J. W. De Bakker, Liber Amicorum","author":"A. Pnueli","year":"1989","unstructured":"A. Pnueli and M. Shalev. What is in a step? In J.W. Klop, J.-J.Ch. Meijer, and J.J.M.M. Rutten, editors, J. W. De Bakker, Liber Amicorum, pages 373\u2013400. CWI, AMsterdam, 1989."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques in Real-Time and Fault-Tolerant Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55092-5_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:57:32Z","timestamp":1605646652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55092-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540550921","9783540466925"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-55092-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}