{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:42:32Z","timestamp":1725496952582},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418641"},{"type":"electronic","value":"9783540453154"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_22","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:28:39Z","timestamp":1196663319000},"page":"332-346","source":"Crossref","is-referenced-by-count":11,"title":["On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Morin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"CONCUR\u201999","author":"R. Alur","year":"1999","unstructured":"Alur R. and Yannakakis M.: Model Checking of Message Sequence Charts. CONCUR\u201999, LNCS 1664 (1999) 114\u2013129"},{"key":"22_CR2","unstructured":"Arnold A.: An extension of the notion of traces and asynchronous automata. Theoretical Informatics and Applications 25 (1991) 355\u2013393"},{"key":"22_CR3","series-title":"Technical report","volume-title":"Syntactic Analysis of Message Sequence Chart Specifications","author":"H. Ben-Abdallah","year":"1996","unstructured":"Ben-Abdallah H. and Leue S.: Syntactic Analysis of Message Sequence Chart Specifications. Technical report 96-12 (University of Waterloo, Canada, 1996)"},{"key":"22_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BFb0035393","volume-title":"TACAS\u201997","author":"H. Ben-Abdallah","year":"1997","unstructured":"Ben-Abdallah H. and Leue S.: Syntactic Detection of Process Divergence and Non-local Choice in Message Sequence Charts. TACAS\u201997, LNCS 1217 (1997) 259\u2013274"},{"key":"22_CR5","unstructured":"Booch G., Jacobson I. and Rumbough J.: Unified Modelling Language User Guide. (Addison-Wesley, 1997)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6 (1960) 66\u201392","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"22_CR7","unstructured":"Caillaud B., Darondeau Ph., H\u00e9lou\u00ebt L. and Lesventes G.: HMSCs as partial specifications... with PNs as completions. Proc. of MOVEP\u20192k, Nantes (2000) 87\u2013103"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1052","volume":"106","author":"R. Cori","year":"1993","unstructured":"Cori R., M\u00e9tivier Y. and Zielonka W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation 106 (1993) 159\u2013202","journal-title":"Information and Computation"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Diekert V. and Rozenberg G.: The Book of Traces. (World Scientific, 1995)","DOI":"10.1142\/2563"},{"key":"22_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-61377-3_41","volume-title":"Logical definability of recognizable and aperiodic languages in concurrency monoids","author":"M. Droste","year":"1996","unstructured":"Droste M. and Kuske D.: Logical definability of recognizable and aperiodic languages in concurrency monoids. LNCS 1092 (1996) 233\u2013251"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(95)00130-1","volume":"154","author":"W. Ebinger","year":"1996","unstructured":"Ebinger W. and Muscholl A.: Logical definability on infinite traces. Theoretical Comp. Science 154 (1996) 67\u201384","journal-title":"Theoretical Comp. Science"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0020-0190(92)90187-Z","volume":"44","author":"P. Gastin","year":"1992","unstructured":"Gastin P., Ochma\u0144ski E., Petit A. and Rozoy, B.: On the decidability of the star problem. Information Processing Letters 44 (1992) 65\u201371","journal-title":"Information Processing Letters"},{"key":"22_CR13","series-title":"Lect Notes Comput Sci","volume-title":"TACAS 2001","author":"E.L. Gunter","year":"2001","unstructured":"Gunter E.L., Muscholl A. and Peled D.: Compositional Message Sequence Charts. TACAS 2001, LNCS (2001)-To appear."},{"key":"22_CR14","unstructured":"H\u00e9lou\u00ebt L., Jard C. and Caillaud B.: An effective equivalence for sets of scenarios represented by HMSCs. Technical report, PI-1205 (IRISA, Rennes, 1998)"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Henriksen J.G, Mukund M., Narayan Kumar, K. and Thiagarajan P.S.: Towards a theory of regular MSC languages. Technical report (BRICS RS-99-52, 1999)","DOI":"10.7146\/brics.v6i52.20122"},{"key":"22_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"On message sequence graphs and finitely generated regular MSC language","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 language. LNCS 1853 (2000) 675\u2013686"},{"key":"22_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-44612-5_36","volume-title":"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. MFCS 2000, LNCS 1893 (2000) 405\u2013414"},{"key":"22_CR18","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"TACAS\u201996","author":"G.J. Holzmann","year":"1996","unstructured":"Holzmann G.J.: Early Fault Detection. TACAS\u201996, LNCS 1055 (1996) 1\u201313"},{"key":"22_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-46432-8_12","volume-title":"FoSSaCS 2000","author":"J.-Fr. Husson","year":"2000","unstructured":"Husson J.-Fr. and Morin R.: On Recognizable Stable Trace Languages. FoSSaCS 2000, LNCS 1784 (2000) 177\u2013191"},{"key":"22_CR20","unstructured":"ITU-TS: Recommendation Z.120: Message Sequence Charts. (Geneva, 1996)"},{"key":"22_CR21","unstructured":"Kirsten D. and Richomme G.: Decidability Equivalence Between the Star Problem and the Finite Power Problem in Trace Monoids. Technical Report ISSN 1430-211X, TUD\/FI99\/03 (Dresden University of Technology, 1999)"},{"key":"22_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44618-4_31","volume-title":"CONCUR 2000","author":"D. Kuske","year":"2000","unstructured":"Kuske D. and Morin R.: Pomsets for Local Trace Languages: Recognizability, Logic and Petri Nets. CONCUR 2000, LNCS 1877 (2000) 426\u2013441"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Lamport L.: Time, Clocks and the Ordering of Events in a Distributed System. Comm. of the ACM, vol. 21, N 27 (1978)-ACM","DOI":"10.1145\/359545.359563"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz A.: Concurrent program schemes and their interpretations. Aarhus University Publication (DAIMI PB-78, 1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"22_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-44618-4_37","volume-title":"CONCUR 2000","author":"M. Mukund","year":"2000","unstructured":"Mukund M., Narayan Kumar K. and Sohoni M.: Synthesizing distributed finite-state systems from MSCs. CONCUR 2000, LNCS 1877 (2000) 521\u2013535"},{"key":"22_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"FoSSaCS\u201998","author":"A. Muscholl","year":"1998","unstructured":"Muscholl A., Peled D. and Su Z.: Deciding Properties for Message Sequence Charts. FoSSaCS\u201998, LNCS 1378 (1998) 226\u2013242"},{"key":"22_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-49019-1_19","volume-title":"FoSSaCS\u201999","author":"A. Muscholl","year":"1999","unstructured":"Muscholl A.: Matching Specifications for Message Sequence Charts. FoSSaCS\u201999, LNCS 1578 (1999) 273\u2013287"},{"key":"22_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"Proc. of MFCS\u201999","author":"A. Muscholl","year":"1999","unstructured":"Muscholl A. and Peled D.: Message sequence graphs and decision problems on Mazurkiewicz traces. Proc. of MFCS\u201999, LNCS 1672 (1999) 81\u201391"},{"key":"22_CR29","first-page":"85","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen M., Plotkin G. and Winskel G.: Petri nets, events structures and domains, part 1. Relationships between Models of Concurrency, TCS 13 (1981) 85\u2013108","journal-title":"Relationships between Models of Concurrency, TCS"},{"key":"22_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/3-540-58043-3_25","volume-title":"Rex\u201993: A decade of concurrency","author":"M. Nielsen","year":"1994","unstructured":"Nielsen M., Sassone V. and Winskel G.: Relationships between Models of Concurrency. Rex\u201993: A decade of concurrency, LNCS 803 (1994) 425\u2013475"},{"key":"22_CR31","first-page":"56","volume":"27","author":"E. Ochma\u0144ski","year":"1985","unstructured":"Ochma\u0144ski E.: Regular behaviour of concurrent systems. Bulletin of the EATCS 27 (Oct. 1985) 56\u201367","journal-title":"Bulletin of the EATCS"},{"key":"22_CR32","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. Int. J. of Parallel Programming 15 (1986) 33\u201371","journal-title":"Int. J. of Parallel Programming"},{"key":"22_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/BFb0023848","volume-title":"Proc. LATIN\u201992","author":"J. Sakarovitch","year":"1992","unstructured":"Sakarovitch J.: The \u201clast\u201d decision problem for rational trace languages. Proc. LATIN\u201992, LNCS 583 (1992) 460\u2013473"},{"key":"22_CR34","unstructured":"Thomas W.: On logical definability of trace languages. Technical University of Munich, report TUM-I9002 (1990) 172\u2013182"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T13:09:54Z","timestamp":1557061794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}