{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:11:02Z","timestamp":1742994662425,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024238"},{"type":"electronic","value":"9783642024245"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02424-5_7","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T14:40:41Z","timestamp":1245249641000},"page":"83-102","source":"Crossref","is-referenced-by-count":4,"title":["Pomset Languages of Finite Step Transition Systems"],"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","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Arnold, A.: An extension of the notion of traces and asynchronous automata. RAIRO. Theoretical Informatics and Applications\u00a025, 355\u2013393 (1991) (Gauthiers-Villars)","DOI":"10.1051\/ita\/1991250403551"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.tcs.2006.01.014","volume":"358","author":"B. Bollig","year":"2006","unstructured":"Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. Theoretical Computer Science\u00a0358, 150\u2013172 (2006)","journal-title":"Theoretical Computer Science"},{"key":"7_CR3","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.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(95)00083-6","volume":"160","author":"B. Courcelle","year":"1996","unstructured":"Courcelle, B.: The monadic second-order logic of graphs X: Linear orderings. Theoretical Computer Science\u00a0160, 87\u2013143 (1996)","journal-title":"Theoretical Computer Science"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Diekert, V., M\u00e9tivier, Y.: Partial Commutation and Traces. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 457\u2013534 (1997)","DOI":"10.1007\/978-3-642-59126-6_8"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. of Math.\u00a051(2), 161\u2013166 (1950)","journal-title":"Ann. of Math."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J.E. Doner","year":"1970","unstructured":"Doner, J.E.: Tree acceptors and some of their applications. J. Computer and Syst. Sciences\u00a04, 406\u2013451 (1970)","journal-title":"J. Computer and Syst. Sciences"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1142\/S0129054198000192","volume":"9","author":"M. Droste","year":"1998","unstructured":"Droste, M., Kuske, D.: Recognizable and logically definable languages of infinite computations in concurrent automata. International Journal of Foundations of Computer Science\u00a09, 295\u2013313 (1998)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00166-3","volume":"247","author":"M. Droste","year":"2000","unstructured":"Droste, M., Gastin, P., Kuske, D.: Asynchronous cellular automata for pomsets. Theoretical Computer Science\u00a0247, 1\u201338 (2000)","journal-title":"Theoretical Computer Science"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF00264612","volume":"27","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-structures Part II: State spaces of concurrent systems. Acta Informatica\u00a027, 343\u2013368 (1990)","journal-title":"Acta Informatica"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45694-5_27","volume-title":"CONCUR 2002 - Concurrency Theory","author":"J. Fanchon","year":"2002","unstructured":"Fanchon, J., Morin, R.: Regular sets of pomsets with autoconcurrency. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 402\u2013417. Springer, Heidelberg (2002)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J.L. Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. Theoretical Computer Science\u00a061, 199\u2013224 (1988)","journal-title":"Theoretical Computer Science"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Grabowski, J.: On partial languages. Fundamenta Informatica IV(2), 427\u2013498 (1981)","DOI":"10.3233\/FI-1981-4210"},{"key":"7_CR14","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":"7_CR15","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/inco.1995.1032","volume":"117","author":"P.W. Hoogers","year":"1995","unstructured":"Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A Trace Semantics for Petri Nets. Information and Computation\u00a0117, 98\u2013114 (1995)","journal-title":"Information and Computation"},{"key":"7_CR16","first-page":"3","volume":"24","author":"A. Kiehn","year":"1988","unstructured":"Kiehn, A.: On the interrelationship between synchronised and non synchronised behaviour of Petri Nets. Journal of Information Processing and Cybernetics. EIK\u00a024, 3\u201318 (1988)","journal-title":"Journal of Information Processing and Cybernetics. EIK"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BFb0055645","volume-title":"CONCUR \u201998 Concurrency Theory","author":"D. Kuske","year":"1998","unstructured":"Kuske, D.: Asynchronous cellular automata and asynchronous automata for pomsets. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 517\u2013532. Springer, Heidelberg (1998)"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(02)00370-5","volume":"299","author":"D. Kuske","year":"2003","unstructured":"Kuske, D.: Towards a language theory for infinite N-free pomsets. Theoretical Computer Science\u00a0299, 347\u2013386 (2003)","journal-title":"Theoretical Computer Science"},{"key":"7_CR19","first-page":"187","volume":"7","author":"D. Kuske","year":"2002","unstructured":"Kuske, D., Morin, R.: Pomsets for local trace languages. Journal of Automata, Languages and Combinatorics\u00a07, 187\u2013224 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K. Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoretical Computer Science\u00a0237, 347\u2013380 (2000)","journal-title":"Theoretical Computer Science"},{"key":"7_CR21","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":"7_CR22","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1142\/S0129054192000231","volume":"3","author":"M. Mukund","year":"1992","unstructured":"Mukund, M.: Petri Nets and Step Transition Systems. International Journal of Foundations of Computer Science\u00a03, 443\u2013478 (1992)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"7_CR23","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":"7_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"W. Thatcher","year":"1968","unstructured":"Thatcher, W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory\u00a02, 57\u201381 (1968)","journal-title":"Math. Systems Theory"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013455 (1997)","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55767-9","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","author":"W. Vogler","year":"1992","unstructured":"Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol.\u00a0625. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02424-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T14:01:50Z","timestamp":1633615310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02424-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024238","9783642024245"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02424-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}