{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:11:10Z","timestamp":1737349870469,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_30","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"358-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hereditary History Preserving Bisimilarity Is Undecidable"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Jurdzi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mogens","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"30_CR1","volume-title":"Hereditary history preserving bisimulations or what is the power of the future perfect in program logics","author":"M. A. Bednarczyk","year":"1991","unstructured":"Marek A. Bednarczyk. Hereditary history preserving bisimulations or what is the power of the future perfect in program logics. Technical report, Polish Academy of Sciences, Gda\u0144sk, April 1991. Available at http:\/\/www.ipipan.gda.pl\/~marek ."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Gian Luca Cattani and Vladimiro Sassone. Higher dimensional transition systems. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 55\u201362, New Brunswick, New Jersey, 27\u201330 July 1996. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1996.561303"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"S\u00f8ren Christensen, Hans H\u00fcttel, and Colin Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121(2):143\u2013148, 1995.","journal-title":"Information and Computation"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Sibylle Fr\u00f6schle. Decidability of plain and hereditary history-preserving bisimilarity for BPP. Presented at 6th International Workshop on Expressiveness in Concurrency, EXPRESS\u201999, Eindhoven, The Netherlands, August 1999.","DOI":"10.1016\/S1571-0661(05)80297-X"},{"key":"30_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-48340-3_32","volume-title":"Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS\u201999","author":"S. Fr\u00f6schle","year":"1999","unstructured":"Sibylle Fr\u00f6schle and Thomas Hildebrandt. On plain and hereditary history-preserving bisimulation. In Miros\u0142aw Kuty lowski, Leszek Pacholski, and Tomasz Wierzbicki, editors, Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS\u201999, volume 1672 of LNCS, pages 354\u2013365, Szklarska Por\u0119ba, Poland, September 6\u201310 1999. Springer."},{"key":"30_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR\u2019 90, Theories of Concurrency: Unification and Extension","author":"R. J. Glabbeek van","year":"1990","unstructured":"R. J. van Glabbeek. The linear time-branching time spectrum (Extended abstract). In J. C. M. Baeten and J. W. Klop, editors, CONCUR\u2019 90, Theories of Concurrency: Unification and Extension, volume 458 of LNCS, pages 278\u2013297, Amsterdam, The Netherlands, 27\u201330 August 1990. Springer-Verlag."},{"key":"30_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-51486-4_71","volume-title":"Mathematical Foundations of Computer Science 1989","author":"R. Glabbeek van","year":"1989","unstructured":"Rob van Glabbeek and Ursula Goltz. Equivalence notions for concurrent systems and refinement of actions (Extended abstract). In A. Kreczmar and G. Mirkowska, editors, Mathematical Foundations of Computer Science 1989, volume 379 of LNCS, pages 237\u2013248, Por\u0105bka-Kozubnik, Poland, August\/September 1989. Springer-Verlag."},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/inco.1994.1101","volume":"115","author":"J. F. Groote","year":"1994","unstructured":"Jan Friso Groote and Hans H\u00fcttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):354\u2013371, 1994.","journal-title":"Information and Computation"},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Matthew Hennessy and Robin Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137\u2013161, 1985.","journal-title":"Journal of the ACM"},{"issue":"1\u20132","key":"30_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"158","author":"Y. Hirshfeld","year":"1996","unstructured":"Yoram Hirshfeld, Mark Jerrum, and Faron Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science, 158(1\u20132):143\u2013159, 1996.","journal-title":"Theoretical Computer Science"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(95)00132-8","volume":"154","author":"L. Jategaonkar","year":"1996","unstructured":"Lalita Jategaonkar and Albert R. Meyer. Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science, 154:107\u2013143, 1996.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1996","unstructured":"Andr\u00e9 Joyal, Mogens Nielsen, and Glynn Winskel. Bisimulation from open maps. Information and Computation, 127(2):164\u2013185, 1996.","journal-title":"Information and Computation"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. C. Kanellakis","year":"1990","unstructured":"Paris C. Kanellakis and Scott A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43\u201368, 1990.","journal-title":"Information and Computation"},{"key":"30_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/BFb0055613","volume-title":"CONCUR\u201998, Concurrency Theory, 9th International Conference, Proceedings","author":"P. Madhusudan","year":"1998","unstructured":"P. Madhusudan and P. S. Thiagarajan. Controllers for discrete event systems via morphisms. In Davide Sangiorgi and Robert de Simone, editors, CONCUR\u201998, Concurrency Theory, 9th International Conference, Proceedings, volume 1466 of LNCS, pages 18\u201333, Nice, France, September 1998. Springer."},{"key":"30_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer, 1980."},{"issue":"2","key":"30_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/210376.210406","volume":"27","author":"F. Moller","year":"1995","unstructured":"Faron Moller and Scott A. Smolka. On the computational complexity of bisimulation. ACM Computing Surveys, 27(2):287\u2013289, 1995.","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"30_CR17","first-page":"221","volume":"2","author":"M. Nielsen","year":"1995","unstructured":"Mogens Nielsen and Christian Clausen. Games and logics for a noninterleaving bisimulation. Nordic Journal of Computing, 2(2):221\u2013249, 1995.","journal-title":"Nordic Journal of Computing"},{"issue":"1\u20132","key":"30_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0304-3975(95)00122-0","volume":"153","author":"M. Nielsen","year":"1996","unstructured":"Mogens Nielsen and Glynn Winskel. Petri nets and bisimulation. Theoretical Computer Science, 153(1\u20132):211\u2013244, 1996.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"30_CR19","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Robert Paige and Robert E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"30_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science: 5th GI-Conference","author":"D. M. R. Park","year":"1981","unstructured":"D. M. R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science: 5th GI-Conference, volume 104 of LNCS, pages 167\u2013183. Springer-Verlag, 1981."},{"key":"30_CR21","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"11","author":"A. Rabinovich","year":"1988","unstructured":"A. Rabinovich and B. Trakhtenbrot. Behaviour structures and nets of processes. Fundamenta Informaticae, 11:357\u2013404, 1988.","journal-title":"Fundamenta Informaticae"},{"key":"30_CR22","series-title":"Lect Notes Comput Sci","first-page":"493","volume-title":"Automata, Languages and Programming, 18th International Colloquium, ICALP\u201991","author":"W. Vogler","year":"1991","unstructured":"Walter Vogler. Deciding history preserving bisimilarity. In Javier Leach Albert, Burkhard Monien, and Mario Rodr\u00edguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, ICALP\u201991, volume 510 of LNCS, pages 493\u2013505, Madrid, Spain, 8\u201312 July 1991. Springer-Verlag."},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Glynn Winskel and Mogens Nielsen. Models for concurrency. In S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 4, Semantic Modelling, pages 1\u2013148. Oxford University Press, 1995.","DOI":"10.1093\/oso\/9780198537809.003.0001"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:56:15Z","timestamp":1737341775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}