{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:40:59Z","timestamp":1725543659583},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540346999"},{"type":"electronic","value":"9783540347002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11767589_6","type":"book-chapter","created":{"date-parts":[[2006,6,20]],"date-time":"2006-06-20T14:38:34Z","timestamp":1150814314000},"page":"84-104","source":"Crossref","is-referenced-by-count":1,"title":["The Synthesis Problem of Netcharts"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Baudru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","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":"6_CR2","unstructured":"Baudru, N., Morin, R.: Safe Implementability of Regular Message Sequence Charts Specifications. In: Proc. of the ACIS 4th Int. Conf. SNDP, pp. 210\u2013217 (2003)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-28644-8_7","volume-title":"CONCUR 2004 - Concurrency Theory","author":"N. Baudru","year":"2004","unstructured":"Baudru, N., Morin, R.: The Pros and Cons of Netcharts. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 99\u2013114. Springer, Heidelberg (2004)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11753728_8","volume-title":"Computer Science \u2013 Theory and Applications","author":"N. Baudru","year":"2006","unstructured":"Baudru, N., Morin, R.: Unfolding Synthesis of Asynchronous Automata. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 46\u201357. Springer, Heidelberg (2006)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-28644-8_10","volume-title":"CONCUR 2004 - Concurrency Theory","author":"B. Bollig","year":"2004","unstructured":"Bollig, B., Leucker, M.: Message-Passing Automata are expressively equivalent to EMSO Logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 146\u2013160. Springer, Heidelberg (2004)"},{"key":"6_CR6","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., H\u00eblou\u00ebt, 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, p. 125. Springer, Heidelberg (2001)"},{"key":"6_CR7","doi-asserted-by":"publisher","DOI":"10.1142\/9789814261456","volume-title":"The Book of Traces","author":"V. Diekert","year":"1995","unstructured":"Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/3-540-45465-9_56","volume-title":"Automata, Languages and Programming","author":"B. Genest","year":"2002","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-Node High-Level MSCs: Model-Checking and Realizability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 657\u2013668. Springer, Heidelberg (2002)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-30550-7_4","volume-title":"Developments in Language Theory","author":"B. Genest","year":"2004","unstructured":"Genest, B., Muscholl, A., Kuske, D.: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 30\u201348. Springer, Heidelberg (2004)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.08.004","volume":"202","author":"J.G. Henriksen","year":"2005","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. Information and computation\u00a0202, 1\u201338 (2005)","journal-title":"Information and computation"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G.J. Holzmann","year":"1996","unstructured":"Holzmann, G.J.: Early Fault Detection. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 1\u201313. Springer, Heidelberg (1996)"},{"key":"6_CR12","unstructured":"ITU-TS Recommendation Z.120: Message Sequence Charts Geneva (1996)"},{"issue":"7","key":"6_CR13","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM\u00a021(7), 558\u2013565 (1978)","journal-title":"Communications of the ACM"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(88)90027-8","volume":"58","author":"Y. M\u00e9tivier","year":"1988","unstructured":"M\u00e9tivier, Y.: On Recognizable Subsets of Free Partially Commutative Monoids. Theor. Comput. Sci.\u00a058, 201\u2013208 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-45315-6_22","volume-title":"Foundations of Software Science and Computation Structures","author":"R. Morin","year":"2001","unstructured":"Morin, R.: On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 332\u2013346. Springer, Heidelberg (2001)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-45841-7_43","volume-title":"STACS 2002","author":"R. Morin","year":"2002","unstructured":"Morin, R.: Recognizable Sets of Message Sequence Charts. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 523\u2013534. Springer, Heidelberg (2002)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-45187-7_20","volume-title":"CONCUR 2003 - Concurrency Theory","author":"M. Mukund","year":"2003","unstructured":"Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Netcharts: Bridging the Gap between HMSCs and Executable Specifications. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 296\u2013310. Springer, Heidelberg (2003)"},{"key":"6_CR18","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":"6_CR19","first-page":"56","volume":"27","author":"E. Ochma\u0144ski","year":"1985","unstructured":"Ochma\u0144ski, E.: Regular behaviour of concurrent systems. Bulletin of the EATCS\u00a027, 56\u201367 (1985)","journal-title":"Bulletin of the EATCS"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"Pratt, V.: Modelling concurrency with partial orders. International Journal of Parallel Programming\u00a015, 33\u201371 (1986)","journal-title":"International Journal of Parallel Programming"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-54233-7_154","volume-title":"Automata, Languages and Programming","author":"W. Thomas","year":"1991","unstructured":"Thomas, W.: On Logics, Tilings, and Automata. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 441\u2013454. Springer, Heidelberg (1991)"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. RAIRO, Theoretical Informatics and Applications\u00a021, 99\u2013135 (1987)","journal-title":"RAIRO, Theoretical Informatics and Applications"}],"container-title":["Lecture Notes in Computer Science","Petri Nets and Other Models of Concurrency - ICATPN 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11767589_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:30Z","timestamp":1619507490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11767589_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540346999","9783540347002"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11767589_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}