{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:12Z","timestamp":1759638972646},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153747"},{"type":"electronic","value":"9783642153754"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15375-4_11","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T18:04:18Z","timestamp":1282327458000},"page":"147-161","source":"Crossref","is-referenced-by-count":5,"title":["A Logic for True Concurrency"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Crafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra","author":"R. Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.: The linear time \u2013 branching time spectrum I; the semantics of concrete, sequential processes. In: Handbook of Process Algebra, pp. 3\u201399. Elsevier, Amsterdam (2001)"},{"issue":"4\/5","key":"11_CR2","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\u00a037(4\/5), 229\u2013327 (2001)","journal-title":"Acta Informatica"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM\u00a032, 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of logic in Computer Science, vol.\u00a04. Clarendon Press, Oxford (1995)","DOI":"10.1093\/oso\/9780198537809.003.0001"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: Observational logics and concurrency models. In: Veni Madhavan, C.E., Nori, K.V. (eds.) FSTTCS 1990. LNCS, vol.\u00a0472, pp. 301\u2013315. Springer, Heidelberg (1990)"},{"key":"11_CR6","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":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/3-540-54233-7_158","volume-title":"Automata, Languages and Programming","author":"W. Vogler","year":"1991","unstructured":"Vogler, W.: Deciding history preserving bisimilarity. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 495\u2013505. Springer, Heidelberg (1991)"},{"key":"11_CR8","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","author":"J. Gutierrez","year":"2009","unstructured":"Gutierrez, J., Bradfield, J.C.: Model-checking games for fixpoint logics with partial order models. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 354\u2013368. Springer, Heidelberg (2009)"},{"key":"11_CR9","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.\u00a05504, pp. 48\u201362. Springer, Heidelberg (2009)"},{"issue":"2","key":"11_CR10","first-page":"221","volume":"2","author":"M. Nielsen","year":"1995","unstructured":"Nielsen, M., Clausen, C.: Games and logics for a noninterleaving bisimulation. Nordic Journal of Computing\u00a02(2), 221\u2013249 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"11_CR11","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)"},{"issue":"1-3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(85)80025-5","volume":"67","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Stirling, C.: The power of the future perfect in program logics. Information and Control\u00a067(1-3), 23\u201352 (1985)","journal-title":"Information and Control"},{"issue":"1","key":"11_CR13","first-page":"102","volume":"9","author":"J. Bradfield","year":"2002","unstructured":"Bradfield, J., Fr\u00f6schle, S.: Independence-friendly modal logic and true concurrency. Nordic Journal of Computing\u00a09(1), 102\u2013117 (2002)","journal-title":"Nordic Journal of Computing"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.) APN 1986. LNCS, vol.\u00a0255, pp. 325\u2013392. Springer, Heidelberg (1987)"},{"key":"11_CR15","unstructured":"Pinchinat, S., Laroussinie, F., Schnoebelen, P.: Logical characterization of truly concurrent bisimulation. Technical Report 114, LIFIA-IMAG, Grenoble (1994)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","first-page":"843","volume-title":"PARLE \u201992. Parallel Architectures and Languages Europe","author":"F. Cherief","year":"1992","unstructured":"Cherief, F.: Back and forth bisimulations on prime event structures. In: Etiemble, D., Syre, J.-C. (eds.) PARLE 1992. LNCS, vol.\u00a0605, pp. 843\u2013858. Springer, Heidelberg (1992)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Phillips, I., Ulidowski, I.: Reverse bisimulations on stable configuration structures. In: Proc. of SOS 2009. Electronic Proceedings in Theoretical Computer Science, vol.\u00a018, pp. 62\u201376 (2010)","DOI":"10.4204\/EPTCS.18.5"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1996.0072","volume":"129","author":"M. Dam","year":"1996","unstructured":"Dam, M.: Model checking mobile processes. Information and Computation\u00a0129(1), 35\u201351 (1996)","journal-title":"Information and Computation"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-49213-5_7","volume-title":"Compositionality: The Significant Difference","author":"M. Dam","year":"1998","unstructured":"Dam, M., Fredlund, L.\u00c5., Gurov, D.: Toward parametric verification of open distributed systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, pp. 150\u2013185. Springer, Heidelberg (1998)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/11538363_25","volume-title":"Computer Science Logic","author":"J. Bradfield","year":"2005","unstructured":"Bradfield, J., Kreutzer, K.: The complexity of independence-friendly fixpoint logic. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 355\u2013368. Springer, Heidelberg (2005)"},{"key":"11_CR21","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, London (1995)","DOI":"10.4324\/9780429321047-4"},{"issue":"2","key":"11_CR22","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. Information and Computation\u00a0184(2), 343\u2013368 (2003)","journal-title":"Information and Computation"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-48340-3_32","volume-title":"Mathematical Foundations of Computer Science 1999","author":"S. Fr\u00f6schle","year":"1999","unstructured":"Fr\u00f6schle, S., Hildebrandt, T.: On plain and hereditary history-preserving bisimulation. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 354\u2013365. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2010 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15375-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T19:24:51Z","timestamp":1711740291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15375-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153747","9783642153754"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15375-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}