Hereditary history preserving Bisimilarity is Undecidable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1770, Issue , 2000, Pages 358-369

  JurdziŃski, Marcin ^a   Nielsen, Mogens ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACTION REFINEMENT; ASYNCHRONOUS TRANSITION SYSTEM; CAUSAL RELATIONSHIPS; CONCURRENT SYSTEMS; HALTING PROBLEMS; HEREDITARY HISTORY; HISTORY-PRESERVING BISIMILARITY; PROMINENT FEATURES;

PETRI NETS;

EID: 84944054430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_30     Document Type: Conference Paper

References (23)

1. 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ńsk, April 1991. Available at http://www.ipipan.gda.pl/~marek.
2. Gian Luca Cattani and Vladimiro Sassone. Higher dimensional transition systems. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 55-62, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
3. Søren Christensen, Hans Hüttel, and Colin Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121(2):143-148, 1995.
4. Sibylle Fröschle. Decidability of plain and hereditary history-preserving bisimilarity for BPP. Presented at 6th International Workshop on Expressiveness in Concurrency, EXPRESS'99, Eindhoven, The Netherlands, August 1999.
5. Sibylle Fröschle and Thomas Hildebrandt. On plain and hereditary historypreserving bisimulation. In Mirosław Kutyłowski, Leszek Pacholski, and Tomasz Wierzbicki, editors, Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, volume 1672 of LNCS, pages 354-365, Szklarska Poręba, Poland, September 6-10 1999. Springer.
6. R. J. van Glabbeek. The linear time-branching time spectrum (Extended abstract). In J. C. M. Baeten and J. W. Klop, editors, CONCUR '90, Theories of Concurrency: Unification and Extension, volume 458 of LNCS, pages 278-297, Amsterdam, The Netherlands, 27-30 August 1990. Springer-Verlag.
7. Rob van Glabbeek and Ursula Goltz. Equivalence notions for concurrent systems and re_nement of actions (Extended abstract). In A. Kreczmar and G. Mirkowska, editors, Mathematical Foundations of Computer Science 1989, volume 379 of LNCS, pages 237-248, Porąbka-Kozubnik, Poland, August/September 1989. Springer-Verlag.
8. Jan Friso Groote and Hans Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):354-371, 1994.
9. Matthew Hennessy and Robin Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137-161, 1985.
10. Yoram Hirshfeld, Mark Jerrum, and Faron Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science, 158(1-2):143-159, 1996.
11. Lalita Jategaonkar and Albert R. Meyer. Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science, 154:107-143, 1996.
12. André Joyal, Mogens Nielsen, and Glynn Winskel. Bisimulation from open maps. Information and Computation, 127(2):164-185, 1996.
13. Paris C. Kanellakis and Scott A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43-68, 1990.
14. P. Madhusudan and P. S. Thiagarajan. Controllers for discrete event systems via morphisms. In Davide Sangiorgi and Robert de Simone, editors, CONCUR'98, Concurrency Theory, 9th International Conference, Proceedings, volume 1466 of LNCS, pages 18-33, Nice, France, September 1998. Springer.
15. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer, 1980.
16. Faron Moller and Scott A. Smolka. On the computational complexity of bisimulation. ACM Computing Surveys, 27(2):287-289, 1995.
17. Mogens Nielsen and Christian Clausen. Games and logics for a noninterleaving bisimulation. Nordic Journal of Computing, 2(2):221-249, 1995.
18. Mogens Nielsen and Glynn Winskel. Petri nets and bisimulation. Theoretical Computer Science, 153(1-2):211-244, 1996.
19. Robert Paige and Robert E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
20. 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-183. Springer-Verlag, 1981.
21. A. Rabinovich and B. Trakhtenbrot. Behaviour structures and nets of processes. Fundamenta Informaticae, 11:357-404, 1988.
22. Walter Vogler. Deciding history preserving bisimilarity. In Javier Leach Albert, Burkhard Monien, and Mario Rodríguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, ICALP'91, volume 510 of LNCS, pages 493-505, Madrid, Spain, 8-12 July 1991. Springer-Verlag.
23. 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-148. Oxford University Press, 1995.