{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T22:42:38Z","timestamp":1792968158205,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540407539","type":"print"},{"value":"9783540451877","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45187-7_20","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T22:38:49Z","timestamp":1277505529000},"page":"296-310","source":"Crossref","is-referenced-by-count":10,"title":["Netcharts: Bridging the Gap between HMSCs and Executable Specifications"],"prefix":"10.1007","author":[{"given":"Madhavan","family":"Mukund","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K. Narayan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P. S.","family":"Thiagarajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/3-540-48224-5_65","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 797\u2013808. Springer, Heidelberg (2001)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"CONCUR\u201999. Concurrency Theory","author":"R. Alur","year":"1999","unstructured":"Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 114\u2013129. Springer, Heidelberg (1999)"},{"key":"20_CR3","volume-title":"Unified Modeling Language User Guide","author":"G. Booch","year":"1997","unstructured":"Booch, G., Jacobson, I., Rumbaugh, J.: Unified Modeling Language User Guide. Addison-Wesley, Reading (1997)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45510-8_5","volume-title":"Modeling and Verification of Parallel Processes","author":"B. Caillaud","year":"2001","unstructured":"Caillaud, B., Darondeau, P., Helouet, L., Lesventes, G.: HMSCs as partial specifications.. with PNs as completions. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol.\u00a02067, pp. 125\u2013152. Springer, Heidelberg (2001)"},{"key":"20_CR5","volume-title":"Cambridge Tracts in Theoretical Computer Science 40","author":"J. Desel","year":"1995","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets. In: Cambridge Tracts in Theoretical Computer Science 40. Cambridge University Press, Cambridge (1995)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Gunter","year":"2001","unstructured":"Gunter, E., Muscholl, A., Peled, D.: Compositional message sequence charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 496\u2013511. Springer, Heidelberg (2001)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Harel, D., Gery, E.: Executable object modelling with statecharts. IEEE Computer, 31\u201342 (July 1997)","DOI":"10.1109\/2.596624"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Automata, Languages and Programming","author":"J.G. Henriksen","year":"2000","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: On Message Sequence Graphs and Finitely Generated Regular MSC Languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 675\u2013686. Springer, Heidelberg (2000)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-44612-5_36","volume-title":"Mathematical Foundations of Computer Science 2000","author":"J.G. Henriksen","year":"2000","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Regular Collections of Message Sequence Charts. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 405\u2013414. Springer, Heidelberg (2000)"},{"key":"20_CR10","unstructured":"ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (1997)"},{"key":"20_CR11","first-page":"291","volume-title":"Proc. 8th SDL Forum, SDL 1997: Time for Testing \u2014 SDL, MSC and Trends","author":"S. Mauw","year":"1997","unstructured":"Mauw, S., Reniers, M.A.: High-level message sequence charts. In: Proc. 8th SDL Forum, SDL 1997: Time for Testing \u2014 SDL, MSC and Trends, pp. 291\u2013306. Elsevier, Amsterdam (1997)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-44618-4_37","volume-title":"CONCUR 2000 - Concurrency Theory","author":"M. Mukund","year":"2000","unstructured":"Mukund, M., Narayan Kumar, K., Sohoni, M.: Synthesizing distributed finitestate systems from MSCs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 521\u2013535. Springer, Heidelberg (2000)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"Mathematical Foundations of Computer Science 1999","author":"A. Muscholl","year":"1999","unstructured":"Muscholl, A., Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 81\u201391. Springer, Heidelberg (1999)"},{"key":"20_CR14","volume-title":"Proc. ACSD 2003","author":"A. Roychoudhury","year":"2003","unstructured":"Roychoudhury, A., Thiagarajan, P.S.: Communicating transaction processes. In: Proc. ACSD 2003. IEEE Press, Los Alamitos (2003) (to appear)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Rudolph, E., Graubmann, P., Grabowski, J.: Tutorial on message sequence charts. Computer Networks and ISDN Systems \u2014 SDL and MSC\u00a028 (1996)","DOI":"10.1016\/0169-7552(95)00122-0"},{"key":"20_CR16","unstructured":"Sgroi, M., Kondratyev, A., Watanabe, Y., Sangiovanni-Vincentelli, A.: Synthesis of Petri nets from MSC-based specifications (unpublished manuscript)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2003 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45187-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T12:59:39Z","timestamp":1559221179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45187-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407539","9783540451877"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45187-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}