{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:27:35Z","timestamp":1743071255942,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319251493"},{"type":"electronic","value":"9783319251509"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-25150-9_22","type":"book-chapter","created":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T11:42:36Z","timestamp":1443181356000},"page":"368-387","source":"Crossref","is-referenced-by-count":1,"title":["MSO Logic and the Partial Order Semantics of Place\/Transition-Nets"],"prefix":"10.1007","author":[{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Avellaneda, F., Morin, R.: Checking partial-order properties of vector addition systems with states. In: Proceedings of ACSD 2013, pp. 100\u2013109. IEEE (2013)","DOI":"10.1109\/ACSD.2013.13"},{"key":"22_CR2","unstructured":"Badouel, E., Darondeau, P.: On the synthesis of general Petri nets. Technical Report PI-1061, IRISA (1996)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-65306-6_22","volume-title":"Lectures on Petri Nets I: Basic Models","author":"E Badouel","year":"1998","unstructured":"Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. LNCS, vol. 1491, pp. 529\u2013586. Springer, Heidelberg (1998)"},{"issue":"2\u20133","key":"22_CR4","doi-asserted-by":"publisher","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":"22_CR5","doi-asserted-by":"crossref","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri nets from infinite partial languages. In: Proceedings of ACSD 2008, pp. 170\u2013179. IEEE (2008)","DOI":"10.1109\/ACSD.2008.4574609"},{"issue":"1\u20133","key":"22_CR6","doi-asserted-by":"publisher","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":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-87405-8_23","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.) Graph Transformations. LNCS, vol. 5214, pp. 336\u2013350. Springer, Heidelberg (2008)"},{"key":"22_CR8","doi-asserted-by":"publisher","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":"22_CR9","doi-asserted-by":"publisher","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."},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BFb0055646","volume-title":"CONCUR\u201998 Concurrency Theory","author":"P Darondeau","year":"1998","unstructured":"Darondeau, P.: Deriving unbounded Petri nets from formal languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR\u201998 Concurrency Theory. LNCS, vol. 1466, pp. 533\u2013548. Springer, Heidelberg (1998)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44988-4_2","volume-title":"Application and Theory of Petri Nets 2000","author":"P Darondeau","year":"2000","unstructured":"Darondeau, P.: Region based synthesis of P\/T-nets and its potential applications. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, p. 16. Springer, Heidelberg (2000)"},{"issue":"3","key":"22_CR12","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. Fundam. Inf. 105(3), 263\u2013289 (2010)","journal-title":"Fundam. Inf."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"22_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata and related arithmetics. Trans. Am. Math. Soc. 98, 21\u201352 (1961)","journal-title":"Trans. Am. Math. Soc."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s002360050106","volume":"34","author":"J Engelfriet","year":"1997","unstructured":"Engelfriet, J., et al.: Context-free graph grammars and concatenation of graphs. Acta Inf. 34, 773\u2013803 (1997)","journal-title":"Acta Inf."},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: Diaz, J. (ed.) Automata, Languages and Programming. LNCS, vol. 154, pp. 264\u2013277. Springer, Heidelberg (1983)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-48224-5_33","volume-title":"Automata, Languages and Programming","author":"P Madhusudan","year":"2001","unstructured":"Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, p. 396. Springer, Heidelberg (2001)"},{"key":"22_CR19","first-page":"166","volume":"62","author":"CA Petri","year":"1962","unstructured":"Petri, C.A.: Fundamentals of a theory of asynchronous information flow. Proc. of IFIP Congr. 62, 166\u2013168 (1962). Munchen","journal-title":"Proc. of IFIP Congr."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Place, T., Zeitoun, M.: Separating regular languages with first-order logic. In: Proceedings of CSL\/LICS, p. 75. ACM (2014)","DOI":"10.1145\/2603088.2603098"},{"key":"22_CR21","first-page":"147159","volume":"172","author":"W Thomas","year":"1992","unstructured":"Thomas, W.: Finite-state recognizability of graph properties. Theor. des Automates et Appl. 172, 147159 (1992)","journal-title":"Theor. des Automates et Appl."},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume":"3","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. Handb. Formal Lang. Theor. 3, 389\u2013455 (1997)","journal-title":"Handb. Formal Lang. Theor."},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","year":"1992","unstructured":"Vogler, Walter (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/978-3-642-39799-8_64","volume-title":"Computer Aided Verification","author":"C Essen von","year":"2013","unstructured":"von Essen, C., Jobstmann, B.: Program repair without regret. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 896\u2013911. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25150-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,8]],"date-time":"2020-09-08T19:27:03Z","timestamp":1599593223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25150-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319251493","9783319251509"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25150-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}