{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:36:38Z","timestamp":1725665798723},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_38","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"445-457","source":"Crossref","is-referenced-by-count":6,"title":["Canonizable Partial Order Generators"],"prefix":"10.1007","author":[{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"CONCUR\u201999. Concurrency Theory","author":"R. Alur","year":"1999","unstructured":"Alur, R., Yannakakis, M.: Model Checking of Message Sequence Charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 114\u2013129. Springer, Heidelberg (1999)"},{"key":"38_CR2","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.) APN 1998. LNCS, vol.\u00a01491, pp. 529\u2013586. Springer, Heidelberg (1998)"},{"issue":"2-3","key":"38_CR3","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. Mathematical Systems Theory\u00a020(2-3), 83\u2013127 (1987)","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"38_CR4","first-page":"437","volume":"88","author":"R. Bergenthum","year":"2008","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri nets from finite partial languages. Fundamenta Informaticae\u00a088(4), 437\u2013468 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"38_CR5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3233\/FI-2009-147","volume":"95","author":"R. Bergenthum","year":"2009","unstructured":"Bergenthum, R., Desel, J., Mauser, S., Lorenz, R.: Synthesis of Petri nets from term based representations of infinite partial languages. Fundamenta Informaticae\u00a095(1), 187\u2013217 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-44988-4_6","volume-title":"Application and Theory of Petri Nets 2000","author":"E. Best","year":"2000","unstructured":"Best, E., Wimmel, H.: Reducing k-Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 63\u201382. Springer, Heidelberg (2000)"},{"issue":"2","key":"38_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/inco.1995.1043","volume":"117","author":"F. Bossut","year":"1995","unstructured":"Bossut, F., Dauchet, M., Warin, B.: A Kleene theorem for a class of planar acyclic graphs. Inform. and Comput.\u00a0117(2), 251\u2013265 (1995)","journal-title":"Inform. and Comput."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Bozapalidis, Kalampakas: Recognizability of graph and pattern languages. Acta Informatica\u00a042 (2006)","DOI":"10.1007\/s00236-006-0006-z"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"B. Courcelle","year":"1987","unstructured":"Courcelle, B.: Graph expressions and graph rewritings. Mathematical Systems Theory\u00a020, 83\u2013127 (1987)","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"38_CR10","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1142\/S0129054192000218","volume":"3","author":"M. Droste","year":"1992","unstructured":"Droste, M.: Concurrent automata and domains. International Journal of Foundations of Computer Science\u00a03(4), 389\u2013418 (1992)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"38_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264611","volume":"27","author":"A. Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures. Part I: Basic notions and the representation problem. Acta Informatica\u00a027(4), 315\u2013342 (1989)","journal-title":"Acta Informatica"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Vereijken, J.J.: Context-free graph grammars and concatenation of graphs. Acta Informatica\u00a034 (1997)","DOI":"10.1007\/s002360050106"},{"issue":"3","key":"38_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J. Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Formal Methods in System Design\u00a020(3), 285\u2013310 (2002)","journal-title":"Formal Methods in System Design"},{"key":"38_CR14","unstructured":"Gaifman, H., Pratt, V.R.: Partial order models of concurrency and the computation of functions. In: Proc. of LICS 1987, pp. 72\u201385 (1987)"},{"issue":"3","key":"38_CR15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/FI-1996-253411","volume":"25","author":"D. Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fundamenta Informaticae\u00a025(3), 399\u2013422 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"38_CR16","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. Theoret. Computer Science\u00a061, 199\u2013224 (1988)","journal-title":"Theoret. Computer Science"},{"issue":"2","key":"38_CR17","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"4","author":"J. Grabowski","year":"1981","unstructured":"Grabowski, J.: On partial languages. Fundamenta Informaticae\u00a04(2), 427 (1981)","journal-title":"Fundamenta Informaticae"},{"key":"38_CR18","unstructured":"Hayman, J., Winskel, G.: The unfolding of general Petri nets. In: Proc. of FTTCS 2008. LIPIcs, vol.\u00a02, pp. 223\u2013234 (2008)"},{"issue":"1","key":"38_CR19","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., Kumar, K.N., Sohoni, M.A., Thiagarajan, P.S.: A theory of regular MSC languages. Inform. and Comput.\u00a0202(1), 1\u201338 (2005)","journal-title":"Inform. and Comput."},{"issue":"1","key":"38_CR20","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/inco.1995.1032","volume":"117","author":"P. Hoogers","year":"1995","unstructured":"Hoogers, P., Kleijn, H., Thiagarajan, P.: A trace semantics for Petri nets. Inform. and Comput.\u00a0117(1), 98\u2013114 (1995)","journal-title":"Inform. and Comput."},{"issue":"1-2","key":"38_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00120-4","volume":"153","author":"P.W. Hoogers","year":"1996","unstructured":"Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structure semantics for general Petri nets. Theoret. Computer Science\u00a0153(1-2), 129\u2013170 (1996)","journal-title":"Theoret. Computer Science"},{"key":"38_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-46432-8_12","volume-title":"Foundation of Software Science and Computation Structures","author":"J.-F. Husson","year":"2000","unstructured":"Husson, J.-F., Morin, R.: On Recognizable Stable Trace Languages. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 177\u2013191. Springer, Heidelberg (2000)"},{"issue":"1","key":"38_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(95)00132-8","volume":"154","author":"L. Jategaonkar","year":"1996","unstructured":"Jategaonkar, L., Meyer, A.R.: Deciding true concurrency equivalences on safe, finite nets. Theoret. Computer Science\u00a0154(1), 107\u2013143 (1996)","journal-title":"Theoret. Computer Science"},{"key":"38_CR24","unstructured":"Kupferman, O., Lustig, Y., Vardi, M.Y., Yannakakis, M.: Temporal synthesis for bounded systems and environments. In: STACS 2011, pp. 615\u2013626 (2011)"},{"issue":"2","key":"38_CR25","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(2), 187\u2013224 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"1-2","key":"38_CR26","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. Theoret. Computer Science\u00a0237(1-2), 347\u2013380 (2000)","journal-title":"Theoret. Computer Science"},{"issue":"12-13","key":"38_CR27","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1016\/j.tcs.2008.11.014","volume":"410","author":"R. Lorenz","year":"2009","unstructured":"Lorenz, R., Juh\u00e1s, G., Bergenthum, R., Desel, J., Mauser, S.: Executability of scenarios in Petri nets. Theor. Comput. Sci.\u00a0410(12-13), 1190\u20131216 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR28","series-title":"Lecture Notes in Computer Science","first-page":"279","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"A.W. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.W.: Trace Theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 279\u2013324. Springer, Heidelberg (1987)"},{"key":"38_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BFb0023477","volume-title":"STACS 97","author":"U. Montanari","year":"1997","unstructured":"Montanari, U., Pistore, M.: Minimal Transition Systems for History-Preserving Bisimulation. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 413\u2013425. Springer, Heidelberg (1997)"},{"key":"38_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-45315-6_22","volume-title":"Foundations of Software Science and Computation Structures","author":"R. Morin","year":"2001","unstructured":"Morin, R.: On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 332\u2013346. Springer, Heidelberg (2001)"},{"key":"38_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Muscholl","year":"1998","unstructured":"Muscholl, A., Peled, D., Su, Z.: Deciding Properties for Message Sequence Charts. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 226\u2013242. Springer, Heidelberg (1998)"},{"issue":"3","key":"38_CR32","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\u00a0105(3), 263\u2013289 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"38_CR33","first-page":"147","volume":"172","author":"W. Thomas","year":"1992","unstructured":"Thomas, W.: Finite-state recognizability of graph properties. Theorie des Automates et Applications\u00a0172, 147\u2013159 (1992)","journal-title":"Theorie des Automates et Applications"},{"key":"38_CR34","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","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T21:37:56Z","timestamp":1640986676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}