{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:45:43Z","timestamp":1778298343745,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540678977","type":"print"},{"value":"9783540446187","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44618-4_37","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:38:51Z","timestamp":1188297531000},"page":"521-535","source":"Crossref","is-referenced-by-count":32,"title":["Synthesizing Distributed Finite-State Systems from MSCs"],"prefix":"10.1007","author":[{"given":"Madhavan","family":"Mukund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. Narayan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milind","family":"Sohoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,21]]},"reference":[{"issue":"2","key":"37_CR1","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"Alur, R., Holzmann, G.J., and Peled, D.: An analyzer for message sequence charts. Software Concepts and Tools, 17(2) (1996) 70\u201377.","journal-title":"Software Concepts and Tools"},{"key":"37_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"Proc. CONCUR\u201999","author":"R. Alur","year":"1999","unstructured":"Alur, R., and Yannakakis, M.: Model checking of message sequence charts. Proc. CONCUR\u201999, LNCS 1664, Springer Verlag (1999) 114\u2013129."},{"key":"37_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BFb0035393","volume-title":"Proc. TACAS\u201997","author":"H. Ben-Abdallah","year":"1997","unstructured":"Ben-Abdallah, H., and Leue, S.: Syntactic detection of process divergence and nonlocal choice in message sequence charts. Proc. TACAS\u201997, LNCS 1217, Springer-Verlag (1997) 259\u2013274."},{"key":"37_CR4","unstructured":"Booch, G., Jacobson, I., and Rumbaugh, J.: Unified Modeling Language User Guide. Addison Wesley (1997)."},{"key":"37_CR5","unstructured":"Damm, W., and Harel, D.: LCS\u2019s: Breathing life into message sequence charts. Proc. FMOODS\u201999, Kluwer Academic Publishers (1999) 293\u2013312."},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Diekert, V., and Rozenberg, G. (Eds.): The book of traces. World Scientific (1995).","DOI":"10.1142\/2563"},{"key":"37_CR7","unstructured":"Harel, D., and Gery, E.: Executable object modeling with statecharts. IEEE Computer, July 1997 (1997) 31\u201342."},{"key":"37_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proc. ICALP 2000","author":"J. G. Henriksen","year":"2000","unstructured":"Henriksen, J. G., Mukund, M., Narayan Kumar K., and Thiagarajan, P. S.: On message sequence graphs and finitely generated regular MSC languages, to appear in Proc. ICALP 2000, LNCS, Springer-Verlag (2000)."},{"key":"37_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Proc. MFCS 2000","author":"J. G. Henriksen","year":"2000","unstructured":"Henriksen, J. G., Mukund, M., Narayan Kumar K., and Thiagarajan, P. S.: Regular collections of message sequence charts, to appear in Proc. MFCS 2000, LNCS, Springer-Verlag (2000)."},{"issue":"5","key":"37_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01211629","volume":"7","author":"P. B. Ladkin","year":"1975","unstructured":"Ladkin, P. B., and Leue, S.: Interpreting message flow graphs. Formal Aspects of Computing\n                           7(5) (1975) 473\u2013509.","journal-title":"Formal Aspects of Computing"},{"key":"37_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1007\/BFb0030632","volume-title":"Proc. TAPSOFT\u201997","author":"V. Levin","year":"1997","unstructured":"Levin, V., and Peled, D.: Verification of message sequence charts via template matching. Proc. TAPSOFT\u201997, LNCS 1214, Springer-Verlag (1997) 652\u2013666."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Mauw, S., and Reniers, M. A.: High-level message sequence charts, Proc. SDL\u2019 97, Elsevier (1997) 291\u2013306.","DOI":"10.1016\/B978-044482816-3\/50020-4"},{"key":"37_CR13","unstructured":"Mukund, M., Narayan Kumar, K., and Sohoni, M.: Keeping track of the latest gossip in message-passing systems. Proc. Structures in Concurrency Theory (STRICT), Workshops in Computing Series, Springer-Verlag (1995) 249\u2013263."},{"key":"37_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-49019-1_19","volume-title":"Proc. FOSSACS\u201999","author":"A. Muscholl","year":"1999","unstructured":"Muscholl, A.: Matching Specifications for Message Sequence Charts. Proc. FOSSACS\u201999, LNCS 1578, Springer-Verlag (1999) 273\u2013287."},{"key":"37_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Proc. FOSSACS\u201998","author":"A. Muscholl","year":"1998","unstructured":"Muscholl, A., Peled, D., and Su, Z.: Deciding properties for message sequence charts. Proc. FOSSACS\u201998, LNCS 1378, Springer-Verlag (1998) 226\u2013242."},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Rudolph, E., Graubmann, P., and Grabowski, J.: Tutorial on message sequence charts. In Computer Networks and ISDN Systems\u2014SDL and MSC, Volume 28 (1996).","DOI":"10.1016\/0169-7552(95)00122-0"},{"key":"37_CR17","first-page":"133","volume-title":"Handbook of Theoretical Computer Science, Volume B","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, Volume B, North-Holland, Amsterdam (1990) 133\u2013191."},{"key":"37_CR18","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Language Theory, Vol. III","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, Automata, and Logic. In Rozenberg, G., and Salomaa, A. (Eds.), Handbook of Formal Language Theory, Vol. III, Springer-Verlag, New York (1997) 389\u2013455."},{"key":"37_CR19","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. R. A. I. R. O.\u2014Inf. Th\u00e9or. et Appl., 21 (1987) 99\u2013135.","journal-title":"R. A. I. R. O.\u2014Inf. Th\u00e9or. et Appl."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2000 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44618-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:50:10Z","timestamp":1550875810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44618-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678977","9783540446187"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44618-4_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}