{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,30]],"date-time":"2025-11-30T22:26:09Z","timestamp":1764541569423,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662242"},{"type":"electronic","value":"9783540485230"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48523-6_14","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T12:06:31Z","timestamp":1197288391000},"page":"169-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["Communicating Hierarchical State Machines"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Sampath","family":"Kannan","sequence":"additional","affiliation":[]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,18]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"R. Alur and M. Yannakakis. Model checking of hierarchical state machines. In Proc. Sixth FSE, pp. 175\u2013188. 1998.","key":"14_CR1","DOI":"10.1145\/291252.288305"},{"unstructured":"G. Booch, I. Jacobson, and J. Rumbaugh. Unified Modeling Language User Guide. Addison Wesley, 1997.","key":"14_CR2"},{"key":"14_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Proc. Workshop on Logic of Programs","author":"E.M. Clarke","year":"1981","unstructured":"E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, pp. 52\u201371. Springer-Verlag, 1981."},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/6.499951","volume":"33","author":"E.M. Clarke","year":"1996","unstructured":"E.M. Clarke and R.P. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6):61\u201367, 1996.","journal-title":"IEEE Spectrum"},{"doi-asserted-by":"crossref","unstructured":"D. Drusinsky and D. Harel. On the power of bounded concurrency i: finite automata. Journal of the ACM, 41(3), 1994.","key":"14_CR5","DOI":"10.1145\/176584.176587"},{"key":"14_CR6","doi-asserted-by":"publisher","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. Science of Computer Programming, 8:231\u2013274, 1987.","journal-title":"Science of Computer Programming"},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/3-540-63141-0_18","volume-title":"CONCUR","author":"D. Harel","year":"1997","unstructured":"D. Harel, O. Kupferman, and M.Y. Vardi. On the complexity of verifying concurrent transition systems. In CONCUR, LNCS 1243, pp. 258\u2013272. 1997."},{"issue":"5","key":"14_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"G.J. Holzmann. The model checker spin. IEEE Trans. on Software Engineering, 23(5):279\u2013295, 1997.","journal-title":"IEEE Trans. on Software Engineering"},{"unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.","key":"14_CR9"},{"unstructured":"B. Selic, G. Gullekson, and P.T. Ward. Real-time object oriented modeling and design. J. Wiley, 1994.","key":"14_CR10"},{"unstructured":"M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. First LICS, pp. 332\u2013344, 1986.","key":"14_CR11"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T03:05:18Z","timestamp":1642820718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}