{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:32Z","timestamp":1740099032780,"version":"3.37.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893655"},{"type":"electronic","value":"9783319893662"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89366-2_9","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T23:52:34Z","timestamp":1523663554000},"page":"165-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Automata for True Concurrency Properties"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tommaso","family":"Padoan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17906-2_31"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1093\/comjnl\/bxp052","volume":"54","author":"G Winskel","year":"2011","unstructured":"Winskel, G.: Events, causality and symmetry. Comput. J. 54(1), 42\u201357 (2011)","journal-title":"Comput. J."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Pichon-Pharabod, J., Sewell, P.: A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions. In: Bod\u00edk, R., Majumdar, R. (eds.) Proceedings of POPL 2016, pp. 622\u2013633. ACM (2016)","DOI":"10.1145\/2837614.2837616"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Jeffrey, A., Riely, J.: On thin air reads towards an event structures model of relaxed memory. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of LICS 2016, pp. 759\u2013767. ACM (2016)","DOI":"10.1145\/2933575.2934536"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-19488-2_2","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"M Dumas","year":"2015","unstructured":"Dumas, M., Garc\u00eda-Ba\u00f1uelos, L.: Process mining reloaded: event structures as a unified representation of process models and event logs. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 33\u201348. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19488-2_2"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/11817963_30","volume-title":"Computer Aided Verification","author":"A Farzan","year":"2006","unstructured":"Farzan, A., Madhusudan, P.: Causal atomicity. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 315\u2013328. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_30"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2015-1243","volume":"140","author":"P Baldan","year":"2015","unstructured":"Baldan, P., Carraro, A.: A causal view on non-intereference. Fundamenta Informaticae 140(1), 1\u201338 (2015)","journal-title":"Fundamenta Informaticae"},{"issue":"4\/5","key":"9_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"R Glabbeek van","year":"2001","unstructured":"van Glabbeek, R., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37(4\/5), 229\u2013327 (2001)","journal-title":"Acta Informatica"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-53487-3_53","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R Nicola De","year":"1990","unstructured":"De Nicola, R., Ferrari, G.L.: Observational logics and concurrency models. In: Nori, K.V., Veni Madhavan, C.E. (eds.) FSTTCS 1990. LNCS, vol. 472, pp. 301\u2013315. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-53487-3_53"},{"key":"9_CR10","unstructured":"Bednarczyk, M.A.: Hereditary history preserving bisimulations or what is the power of the future perfect in program logics. Technical report, Polish Academy of Sciences (1991)"},{"key":"9_CR11","unstructured":"Pinchinat, S., Laroussinie, F., Schnoebelen, P.: Logical characterization of truly concurrent bisimulation. Technical report 114, LIFIA-IMAG, Grenoble (1994)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Penczek, W.: Branching time and partial order in temporal logics. In: Time and Logic: A Computational Approach, pp. 179\u2013228. UCL Press (1995)","DOI":"10.4324\/9780429321047-4"},{"issue":"2","key":"9_CR13","first-page":"221","volume":"2","author":"M Nielsen","year":"1995","unstructured":"Nielsen, M., Clausen, C.: Games and logics for a noninterleaving bisimulation. Nord. J. Comput. 2(2), 221\u2013249 (1995)","journal-title":"Nord. J. Comput."},{"issue":"1","key":"9_CR14","first-page":"102","volume":"9","author":"J Bradfield","year":"2002","unstructured":"Bradfield, J., Fr\u00f6schle, S.: Independence-friendly modal logic and true concurrency. Nord. J. Comput. 9(1), 102\u2013117 (2002)","journal-title":"Nord. J. Comput."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Alur, R., Peled, D., Penczek, W.: Model-checking of causality properties. In: Proceedings of LICS 1995, pp. 90\u2013100. IEEE Computer Society (1995)","DOI":"10.1109\/LICS.1995.523247"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-04081-8_24","volume-title":"CONCUR 2009 - Concurrency Theory","author":"J Gutierrez","year":"2009","unstructured":"Gutierrez, J., Bradfield, J.: Model-checking games for fixpoint logics with partial order models. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 354\u2013368. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04081-8_24"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-00596-1_5","volume-title":"Foundations of Software Science and Computational Structures","author":"J Gutierrez","year":"2009","unstructured":"Gutierrez, J.: Logics and bisimulation games for concurrency, causality and conflict. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 48\u201362. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_5"},{"key":"9_CR18","unstructured":"Gutierrez, J.: On bisimulation and model-checking for concurrent systems with partial order semantics. Ph.D. thesis, University of Edinburgh (2011)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Madhusudan, P.: Model-checking trace event structures. In: Proceedings of LICS 2013, pp. 371\u2013380. IEEE Computer Society (2003)","DOI":"10.1109\/LICS.2003.1210077"},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2629638","volume":"61","author":"P Baldan","year":"2014","unstructured":"Baldan, P., Crafa, S.: A logic for true concurrency. J. ACM 61(4), 24:1\u201324:36 (2014)","journal-title":"J. ACM"},{"issue":"2","key":"9_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0960129513000510","volume":"24","author":"I Phillips","year":"2014","unstructured":"Phillips, I., Ulidowski, I.: Event identifier logic. Math. Struct. Comput. Sci. 24(2), 1\u201351 (2014)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01178506","volume":"28","author":"E Best","year":"1991","unstructured":"Best, E., Devillers, R., Kiehn, A., Pomello, L.: Fully concurrent bisimulation. Acta Informatica 28, 231\u2013261 (1991)","journal-title":"Acta Informatica"},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"11","author":"AM Rabinovich","year":"1988","unstructured":"Rabinovich, A.M., Trakhtenbrot, B.A.: Behaviour structures and nets. Fundamenta Informaticae 11, 357\u2013404 (1988)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/BFb0013030","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"P Degano","year":"1989","unstructured":"Degano, P., De Nicola, R., Montanari, U.: Partial orderings descriptions and observations of nondeterministic concurrent processes. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1988. LNCS, vol. 354, pp. 438\u2013466. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0013030"},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0890-5401(03)00064-6","volume":"184","author":"M Jurdzinski","year":"2003","unstructured":"Jurdzinski, M., Nielsen, M., Srba, J.: Undecidability of domino games and hhp-bisimilarity. Inf. Comput. 184(2), 343\u2013368 (2003)","journal-title":"Inf. Comput."},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-662-54458-7_24","volume-title":"Foundations of Software Science and Computation Structures","author":"P Baldan","year":"2017","unstructured":"Baldan, P., Padoan, T.: Local model checking in a logic for true concurrency. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 407\u2013423. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_24"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45711-9_14","volume-title":"Formal and Natural Computing","author":"PS Thiagarajan","year":"2002","unstructured":"Thiagarajan, P.S.: Regular event structures and finite Petri nets: a conjecture. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 244\u2013253. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45711-9_14"},{"issue":"1\u20132","key":"9_CR28","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"EA Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the $$\\rm \\mu $$\u03bc-calculus and its fragments. Theor. Comput. Sci. 258(1\u20132), 491\u2013522 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-16066-3_15","volume-title":"Computation Theory","author":"AW Mostowski","year":"1985","unstructured":"Mostowski, A.W.: Regular expressions for infinite trees and a standard form of automata. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 157\u2013168. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-16066-3_15"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-36387-4_7","volume-title":"Automata Logics, and Infinite Games","author":"H Klauck","year":"2002","unstructured":"Klauck, H.: Algorithms for parity games. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata Logics, and Infinite Games. LNCS, vol. 2500, pp. 107\u2013129. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4_7"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/11812128_17","volume-title":"Implementation and Application of Automata","author":"PA Abdulla","year":"2006","unstructured":"Abdulla, P.A., Kaati, L., H\u00f6gberg, J.: Bisimulation minimization of tree automata. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 173\u2013185. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11812128_17"},{"key":"9_CR32","volume-title":"Kommunikation mit Automaten","author":"C Petri","year":"1962","unstructured":"Petri, C.: Kommunikation mit Automaten. Schriften des Institutes f\u00fcr Instrumentelle Matematik, Bonn (1962)"},{"key":"9_CR33","unstructured":"Padoan, T.: True concurrency workbench. http:\/\/github.com\/tpadoan\/TCWB"},{"key":"9_CR34","unstructured":"Chalopin, J., Chepoi, V.: A counterexample to Thiagarajan\u2019s conjecture on regular event structures. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) Proceedings of ICALP 2017, LIPIcs, vol. 80, pp. 101:1\u2013101:14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0035386","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"W Penczek","year":"1997","unstructured":"Penczek, W.: Model-checking for a subclass of event structures. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 145\u2013164. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0035386"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","volume-title":"CONCUR \u201996: Concurrency Theory","author":"D Janin","year":"1996","unstructured":"Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 263\u2013277. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61604-7_60"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BFb0054166","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Stevens","year":"1998","unstructured":"Stevens, P., Stirling, C.: Practical model-checking using games. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 85\u2013101. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054166"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89366-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,19]],"date-time":"2022-08-19T16:03:04Z","timestamp":1660924984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89366-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893655","9783319893662"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89366-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}