{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:22Z","timestamp":1760202682742},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319127354"},{"type":"electronic","value":"9783319127361"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12736-1_25","type":"book-chapter","created":{"date-parts":[[2014,10,13]],"date-time":"2014-10-13T10:53:24Z","timestamp":1413197604000},"page":"469-488","source":"Crossref","is-referenced-by-count":1,"title":["Hereditary History-Preserving Bisimilarity: Logics and Automata"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[]},{"given":"Silvia","family":"Crafa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4\/5","key":"25_CR1","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":"25_CR2","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial order Approach to Model Checking. EACTS Monographs. Springer (2008)"},{"key":"25_CR3","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":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Information and Computation\u00a0127(2), 164\u2013185 (1996)","journal-title":"Information and Computation"},{"key":"25_CR5","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)"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0960129511000429","volume":"22","author":"I. Phillips","year":"2012","unstructured":"Phillips, I., Ulidowski, I.: A hierarchy of reverse bisimulations on stable configuration structures. Mathematical Structures in Computer Science\u00a022(2), 333\u2013372 (2012)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1-2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"I. Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. Journal of Logic and Algebraic Programming\u00a073(1-2), 70\u201396 (2007)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible p-calculus. In: Proc. of LICS 2013, pp. 388\u2013397. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.45"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Baldan, P., Crafa, S.: A logic for true concurrency. Journal of the ACM\u00a061(4), 24:1\u201324:36 (2014)","DOI":"10.1145\/2629638"},{"issue":"2","key":"25_CR10","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. Mathematical Structures in Computer Science\u00a024(2), 1\u201351 (2014)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"25_CR11","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"},{"issue":"1-3","key":"25_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"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11419822_1","volume-title":"Formal Methods for Mobile Computing","author":"U. Montanari","year":"2005","unstructured":"Montanari, U., Pistore, M.: History-Dependent automata: An introduction. In: Bernardo, M., Bogliolo, A. (eds.) SFM-Moby 2005. LNCS, vol.\u00a03465, pp. 1\u201328. Springer, Heidelberg (2005)"},{"issue":"2","key":"25_CR14","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"},{"issue":"1","key":"25_CR15","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(1), 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"25_CR16","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":"P.S. 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.\u00a02300, pp. 244\u2013256. Springer, Heidelberg (2002)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"25_CR18","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":"25_CR19","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)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: Proc. of LICS 2011, pp. 355\u2013364. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.48"},{"key":"25_CR21","unstructured":"Prisacariu, C.: The glory of the past and geometrical concurrency. CoRR abs\/1206.3136 (2012)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12736-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:13:41Z","timestamp":1559002421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12736-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319127354","9783319127361"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12736-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}