On plain and hereditary history-preserving bisimulation

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

Volumn 1672, Issue , 1999, Pages 354-365

  Fröschle, Sibylle B ^a   Hildebrandt, Thomas T ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BISIMILARITY; BISIMULATIONS; HEREDITARY HISTORY; HISTORY PRESERVING BISIMULATION; NON-TRIVIAL; STEPPING STONE; THEORETICAL TERMS;

COMPUTABILITY AND DECIDABILITY;

EID: 84949233239     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_32     Document Type: Conference Paper

References (19)

1. M. Bednarczyk. Hereditary history preserving bisimulation or what is the power of the future perfect in program logics. Technical report, Polish Acad, of Sciences, Gdansk, 1991.
2. E. Best, R. Devillers, A. Kiehn, and L. Pomello. Concurrent bisimulations in Petri nets. Acta Inform., 28(3):231-264, 1991.
3. A. Cheng. Reasoning About Concurrent Computational Systems. PhD thesis, BRICS, Dep. of Computer Science, University of Aarhus, 1996.
4. A. Cheng and M. Nielsen. Open maps (at) work. Research Series RS-95-23, BRICS, Dep. of Computer Science, University of Aarhus, Apr. 1995.
5. P. Degano, R. De Nicola, and U. Montanari. Partial orderings descriptions and observations of nondeterministic concurrent processes. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of LNCS, pages 438-466, 1989.
6. S. Fröschle. On the decidability problem of strong history-preserving bisimulation. Progress Report, 1998.
7. S. Fröschle and T. T. Hildebrandt. On plain and hereditary history-preserving bisimulation. Technical Report RS-99-4, BRICS, Dep. of Computer Science, University of Aarhus, 1999.
8. L. Jategaonkar and A. R. Meyer. Deciding true concurrency equivalences on safe, finite nets. Theor. Comp. Sei., 154(1):107-143, 1996.
9. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Inform, and Comput., 127(2):164-185, 1996.
10. U. Montanari and M. Pistore. Minimal transition systems for history-preserving bisimulation. In STACS '97, volume 1200 of LNCS, pages 413-425. Springer, 1997.
11. M. Mukund and P. S. Thiagarajan. Linear time temporal logics over Mazurkiewicz traces. In POMIV '96, volume 29 of DIMACS, pages 171-201. AMS, 1997.
12. M. Nielsen and C. Clausen. Bisimulations, games and logic. Technical Report RS-94-6, BRICS, Dep. of Computer Science, University of Aarhus, April 1994.
13. A. Rabinovich and B. A. T. Yakhtenbrot. Behavior structures and nets. Fund. Inform., ll(4):357-403, 1988.
14. R. van Glabbeek and U. Goltz. Equivalence notions for concurrent systems and refinement of actions. In MFCS '89, volume 379 of LNCS, pages 237-248. Springer, 1989.
15. R. van Glabbeek and U. Goltz. Refinement of actions and equivalence notions for concurrent systems, 1998. http://theory.stanford.edu/ rvg/abstracts.html.
16. W. Vogler. Deciding history preserving bisimilarity. In Automata, languages and programming '91, volume 510 of LNCS, pages 495-505. Springer, 1991.
17. W. Vogler. Bisimulation and action refinement. Theor. Comp. Sei., 114(1):173- 200, 1993.
18. W. Vogler. Generalized OM-bisimulation. Inform, and Comput., 118(l):38-47, 1995.
19. G. Winskel and M. Nielsen. Models for concurrency. In Handbook of logic in computer science, Vol. 4, Oxford Sei. Publ., pages 1-148. Oxford Univ. Press, New York, 1995.