{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:16:56Z","timestamp":1778249816503,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440437","type":"print"},{"value":"9783540456940","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45694-5_27","type":"book-chapter","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T03:44:18Z","timestamp":1191555858000},"page":"402-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Regular Sets of Pomsets with Autoconcurrency"],"prefix":"10.1007","author":[{"given":"Jean","family":"Fanchon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"27_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\u2019 99","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis: Model Checking of Message Sequence Charts. CONCUR\u2019 99, LNCS 1664 (1999) 114\u2013129"},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1051\/ita\/1991250403551","volume":"25","author":"A. Arnold","year":"1991","unstructured":"A. Arnold: An extension of the notion of traces and asynchronous automata. Theoretical Informatics and Applications 25 (1991) 355\u2013393","journal-title":"Theoretical Informatics and Applications"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-3-642-59126-6_8","volume":"3","author":"V. Diekert","year":"1997","unstructured":"V. Diekert and Y. M\u00e9tivier: Partial Commutations and Traces. Handbook of Formal languages, vol. 3 (1997) 457\u2013533","journal-title":"Handbook of Formal languages"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00166-3","volume":"247","author":"M. Droste","year":"2000","unstructured":"M. Droste, P. Gastin, and D. Kuske: Asynchronous cellular automata for pomsets. Theoretical Computer Science Vol. 247 (2000) 1\u201338","journal-title":"Theoretical Computer Science"},{"key":"27_CR5","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":"M. Droste and D. Kuske: Logical definability of recognizable and aperiodic languages in concurrency monoids. LNCS 1092 (1996) 233\u2013251"},{"key":"27_CR6","unstructured":"J. Fanchon: A syntactic congruence for the recognizability of pomset languages. RR 99008 (LAAS, Toulouse, 1999)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J. L. Gischer","year":"1988","unstructured":"J. L. Gischer: The equational theory of pomsets. Theoretical Comp. Science 61 (1988) 199\u2013224","journal-title":"Theoretical Comp. Science"},{"issue":"2","key":"27_CR8","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"IV","author":"J. Grabowski","year":"1981","unstructured":"J. Grabowski: On partial languages. Fund. Informatica IV(2) (1981) 427\u2013498","journal-title":"Fund. Informatica"},{"key":"27_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1007\/3-540-45022-X_55","volume-title":"Infinite series-parallel posets: logic and languages","author":"D. Kuske","year":"2000","unstructured":"D. Kuske: Infinite series-parallel posets: logic and languages. LNCS 1853 (2000) 648\u2013662"},{"key":"27_CR10","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":"D. Kuske and R. Morin: Pomsets for Local Trace Languages\u2014 Recognizability, Logic & Petri Nets. CONCUR 2000, LNCS 1877 (2000) 426\u2013440"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K. Lodaya","year":"2000","unstructured":"K. Lodaya and P. Weil: Series-parallel languages and the bounded-width property. Theoretical Comp. Science 237 (2000) 347\u2013380","journal-title":"Theoretical Comp. Science"},{"key":"27_CR12","series-title":"Lect Notes Comput Sci","first-page":"332","volume-title":"STACS 2002","author":"R. Morin","year":"2002","unstructured":"R. Morin: Recognizable Sets of Message Sequence Charts. STACS 2002, LNCS 2030 (2002) 332\u2013342"},{"key":"27_CR13","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":"M. Mukund, K. Narayan Kumar, and M. Sohoni: Synthesizing distributed finitestate systems from MSCs. CONCUR 2000, LNCS 1877 (2000) 521\u2013535"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"V. Pratt: Modelling concurrency with partial orders. Int. J. of Parallel Programming 15 (1986) 33\u201371","journal-title":"Int. J. of Parallel Programming"},{"key":"27_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BFb0030586","volume-title":"TAPSOFT 97","author":"W. Thomas","year":"1998","unstructured":"W. Thomas: Automata Theory on Trees and Partial Orders. TAPSOFT 97, LNCS 1214 (1998) 20\u201334"},{"key":"27_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-55767-9","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","author":"W. Vogler","year":"1992","unstructured":"W. Vogler: Modular Construction and Partial Order Semantics of Petri Nets. LNCS 625 (1992) 252\u2013275"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2002 \u2014 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45694-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:55:26Z","timestamp":1778248526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45694-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440437","9783540456940"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45694-5_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}