{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:44:41Z","timestamp":1780994681210,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540664086","type":"print"},{"value":"9783540483403","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48340-3_8","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:04:52Z","timestamp":1184591092000},"page":"81-91","source":"Crossref","is-referenced-by-count":57,"title":["Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces"],"prefix":"10.1007","author":[{"given":"Anca","family":"Muscholl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"R. Alur, G. H. Holzmann, and D. A. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70\u201377, 1996.","journal-title":"Software Concepts and Tools"},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BFb0035393","volume-title":"Proc. of Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201997)","author":"H. Ben-Abdallah","year":"1997","unstructured":"H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non local choice in message sequence charts. In Proc. of Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201997), LNCS 1217, pp. 259\u2013274."},{"key":"8_CR3","unstructured":"M. Clerbout. Commutations Partielles et Families de Langages. Th\u00e8se, Universit\u00e9 des Sciences et Technologies de Lille (France), 1984."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0890-5401(87)90040-X","volume":"73","author":"M. Clerbout","year":"1987","unstructured":"M. Clerbout and M. Latteux. Semi-Commutations. Information and Computation, 73:59\u201374, 1987.","journal-title":"Information and Computation"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.","DOI":"10.1142\/2563"},{"issue":"2","key":"8_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg and E. H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics, 16(2):285\u2013296, 1966.","journal-title":"Pacific Journal of Mathematics"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1002\/bltj.2034","volume":"2","author":"G. Holzmann","year":"1997","unstructured":"G. Holzmann, D. Peled, and M. Redberg. Design tools for requirements engineering. Bell Labs Technical Journal-Software, 2(1):86\u201395, 1997.","journal-title":"Bell Labs Technical Journal-Software"},{"key":"8_CR8","series-title":"DAIMI Rep","volume-title":"Concurrent program schemes and their interpretations","author":"A. Mazurkiewicz","year":"1977","unstructured":"A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977."},{"key":"8_CR9","first-page":"121","volume":"20","author":"Y. M\u00e9tivier","year":"1986","unstructured":"Y. M\u00e9tivier. Une condition suffisante de reconnaissabilit\u00e9 dans un mono\u00efde partiellement commutatif. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications, 20:121\u2013127, 1986.","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(88)90027-8","volume":"58","author":"Y. M\u00e9tivier","year":"1988","unstructured":"Y. M\u00e9tivier. On recognizable subsets of free partially comutative monoids. Theoretical Computer Science, 58:201\u2013208, 1988.","journal-title":"Theoretical Computer Science"},{"key":"8_CR11","unstructured":"A. Muscholl. Decision and complexity issues on concurrent systems. Habilitationsschrift (postdoctoral thesis), Universit\u00e4t Stuttgart, Jan. 1999. Submitted."},{"key":"8_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Proc. of the 1st Int. Conference on Foundations of Software Science and Computation Structures (FoSSaCS\u201998)","author":"A. Muscholl","year":"1998","unstructured":"A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Proc. of the 1st Int. Conference on Foundations of Software Science and Computation Structures (FoSSaCS\u201998), LNCS 1378, pp. 226\u2013242, 1998."},{"key":"8_CR13","first-page":"56","volume":"27","author":"E. Ochma\u0144ski","year":"1985","unstructured":"E. Ochma\u0144ski. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:56\u201367, Oct. 1985.","journal-title":"Bulletin of the European Association for Theoretical Computer Science (EATCS)"},{"key":"8_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/BFb0023848","volume-title":"The \u201clast\u201d decision problem for rational trace languages","author":"J. Sakarovitch","year":"1992","unstructured":"J. Sakarovitch. The \u201clast\u201d decision problem for rational trace languages. Report LITP 91.77, Univ. Paris 6, 1991. Abstract presented at the 1st Int. Symp. of Latin American Theor. Informatics (LATIN\u201992), LNCS 583 (1992), pp. 460\u2013473."},{"key":"8_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0055048","volume-title":"Proc. of the 25th International Colloquium on Automata, Languages and Programming (ICALP\u201998)","author":"I. Walukiewicz","year":"1998","unstructured":"I. Walukiewicz. Difficult configurations \u2014 on the complexity of LTrL. In Proc. of the 25th International Colloquium on Automata, Languages and Programming (ICALP\u201998), LNCS 1443, pp. 140\u2013151, 1998."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48340-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T14:06:59Z","timestamp":1538834819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48340-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664086","9783540483403"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48340-3_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}