{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:12:36Z","timestamp":1725862356453},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662529201"},{"type":"electronic","value":"9783662529218"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-52921-8_13","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T15:22:30Z","timestamp":1470410550000},"page":"200-214","source":"Crossref","is-referenced-by-count":0,"title":["Causality in Bounded Petri Nets is MSO Definable"],"prefix":"10.1007","author":[{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"issue":"2\u20133","key":"13_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M Bauderon","year":"1987","unstructured":"Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Math. Syst. Theor. 20(2\u20133), 83\u2013127 (1987)","journal-title":"Math. Syst. Theor."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Heggernes, P., Telle, J.A.: Recognizability equals definability for graphs of bounded treewidth and bounded chordality. In: Proceedings of the 7th European Conference on Combinatorics (EUROCOMB 2015) (2015)","DOI":"10.1016\/j.endm.2015.06.076"},{"issue":"1\u20133","key":"13_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.tcs.2004.09.040","volume":"332","author":"F-J Brandenburg","year":"2005","unstructured":"Brandenburg, F.-J., Skodinis, K.: Finite graph automata for linear and boundary graph languages. Theor. Comput. Sci. 332(1\u20133), 199\u2013232 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Transformations","author":"HS Bruggink","year":"2008","unstructured":"Bruggink, H.S., K\u00f6nig, B.: On the recognizability of arrow and graph languages. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214. Springer, Heidelberg (2008)"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second order arithmetic and finite automata. Z. Math. Logik Grundl. Math. 6, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundl. Math."},{"issue":"1","key":"13_CR6","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"2","key":"13_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B Courcelle","year":"1991","unstructured":"Courcelle, B.: The monadic second-order logic of graphs V: on closing the gap between definability and recognizability. Theor. Comput. Sci. 80(2), 153\u2013202 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, vol. 138. Cambridge University Press, Cambridge (2012)"},{"issue":"3","key":"13_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.3233\/FI-2010-367","volume":"105","author":"M Oliveira Oliveira de","year":"2010","unstructured":"de Oliveira Oliveira, M.: Hasse diagram generators and Petri nets. Fundamenta Informaticae 105(3), 263\u2013289 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-642-28332-1_38","volume-title":"Language and Automata Theory and Applications","author":"M Oliveira Oliveira de","year":"2012","unstructured":"de Oliveira Oliveira, M.: Canonizable partial order generators. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 445\u2013457. Springer, Heidelberg (2012)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-319-03898-8_12","volume-title":"Parameterized and Exact Computation","author":"M Oliveira Oliveira de","year":"2013","unstructured":"de Oliveira Oliveira, M.: Subgraphs satisfying MSO properties on z-topologically orderable digraphs. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 123\u2013136. Springer, Heidelberg (2013)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-25150-9_22","volume-title":"Theoretical Aspects of Computing - ICTAC 2015","author":"M Oliveira Oliveira de","year":"2015","unstructured":"de Oliveira Oliveira, M.: MSO logic and the partial order semantics of place\/transition-nets. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 368\u2013387. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-25150-9_22"},{"issue":"10","key":"13_CR13","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1007\/s002360050106","volume":"34","author":"J Engelfriet","year":"1997","unstructured":"Engelfriet, J., Vereijken, J.J.: Context-free graph grammars and concatenation of graphs. Acta Informatica 34(10), 773\u2013803 (1997)","journal-title":"Acta Informatica"},{"key":"13_CR14","unstructured":"Gaifman, H., Pratt, V.R.: Partial order models of concurrency and the computation of functions. In: LICS 1987, pp. 72\u201385 (1987)"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"JL Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. Theor. Comput. Sci. 61, 199\u2013224 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/BFb0036914","volume-title":"Automata, Languages and Programming","author":"U Goltz","year":"1983","unstructured":"Goltz, U., Reisig, W.: Processes of place\/transition-nets. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 264\u2013277. Springer, Heidelberg (1983)"},{"key":"13_CR17","unstructured":"Jaffke, L., Bodlaender, H.L.: Definability equals recognizability for k-outerplanar graphs. In: Proceedings of the 10th International Symposium on Parameterized and Exact Computation, (IPEC 2015). LIPIcs, vol. 43, pp. 175\u2013186 (2015)"},{"key":"13_CR18","unstructured":"Jaffke, L., Bodlaender, H.L.: MSOL-definability equals recognizability for Halin graphs and bounded degree $$k$$ -outerplanar graphs (2015). Preprint arXiv:1503.01604"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-60043-4_59","volume-title":"Algebraic Methodology and Software Technology","author":"LJ Jagadeesan","year":"1995","unstructured":"Jagadeesan, L.J., Jagadeesan, R.: Causality and true concurrency: a data-flow analysis of the pi-calculus. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol. 936, pp. 277\u2013291. Springer, Heidelberg (1995)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/3-540-63165-8_233","volume-title":"Automata, Languages and Programming","author":"V Kabanets","year":"1997","unstructured":"Kabanets, V.: Recognizability equals definability for partial $$k$$ -paths. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 805\u2013815. Springer, Heidelberg (1997)"},{"issue":"3\u20134","key":"13_CR21","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/s004530010024","volume":"27","author":"D Kaller","year":"2000","unstructured":"Kaller, D.: Definability equals recognizability of partial 3-trees and $$k$$ -connected partial $$k$$ -trees. Algorithmica 27(3\u20134), 348\u2013381 (2000)","journal-title":"Algorithmica"},{"key":"13_CR22","series-title":"the (Concur 1997), volume of","first-page":"317","volume-title":"CONCUR 1997: Concurrency Theory","author":"R Langerak","year":"1997","unstructured":"Langerak, R., Brinksma, E., Katoen, J.-P.: Causal ambiguity and partial orders in event structures. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 317\u2013331. Springer, Heidelberg (1997)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1007\/BFb0028596","volume-title":"STACS 98","author":"D Lapoire","year":"1998","unstructured":"Lapoire, D.: Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 618\u2013628. Springer, Heidelberg (1998)"},{"key":"13_CR24","unstructured":"Petri, C.A.: Fundamentals of a theory of asynchronous information flow. In: Proceedings of IFIP Congress 62, Munchen, pp. 166\u2013168 (1962)"},{"key":"13_CR25","first-page":"147","volume":"172","author":"W Thomas","year":"1992","unstructured":"Thomas, W.: Finite-state recognizability of graph properties. Theorie des Automates et Applications 172, 147\u2013159 (1992)","journal-title":"Theorie des Automates et Applications"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","year":"1992","unstructured":"Vogler, W. (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-52921-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T21:36:37Z","timestamp":1600983397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-52921-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662529201","9783662529218"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-52921-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}