Branching Bisimilarity with Explicit Divergence

• Autorzy: van Glabbeek R. , Luttik B. , Trčka N.
• Języki publikacji: EN

Abstrakty

EN

We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with until- and divergence modalities.

Słowa kluczowe

EN

branching bisimilarity

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2009
• Tom: Vol. 93, nr 4
• Strony: 371--392
• Opis fizyczny: Bibliogr. 9 poz., wykr.

Twórcy

autor

van Glabbeek R.

autor

Luttik B.

autor

Trčka N.

• Technische Universiteit Eindhoven, Department of Mathematics and Computer science, PO. Box 513, NL-5600 MB Eindhoven, The Netherlands,

Bibliografia

• [1] T. Basten (1996): Branching bisimilarity is an equivalence indeed! Information Processing Letters 58(3), pp. 141-147.
• [2] R. De Nicola & F.W. Vaandrager (1995): Three logics for branching bisimulation. Journal of the ACM 42(2), pp. 458-487
• [3] R. Gerth, R. Kuiper, D. Peled & W. Penczek (1999): A partial order approach to branching time logic model checking. Information and Computation 150(2), pp. 132-152.
• [4] RJ. van Glabbeek (1993): The linear time - branching time spectrum II. In E. Best, editor: Proceedings CONCURJ93, LNCS 715, Springer, pp. 66-81.
• [5] R.J. van Glabbeek, B. Luttik & N. Trcka: Computation tree logic and deadlock detection. Submitted. Available at http://theory.stanford.edu/~rvg/abstracts.html#73.
• [6] R.J. van Glabbeek & W.P. Weijland (1996): Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), pp. 555-600.
• [7] M. Hennessy & R. Milner (1985): Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32(1), pp. 137-161.
• [8] F. Laroussinie, S. Pinchinat&Ph. Schnoebelen(1995): Translations between modal logics of reactive systems. Theoretical Computer Science 140(1), pp. 53-71.
• [9] S. Nejati (2003): Refinement relations on partial specifications. Master's thesis, University of Toronto