Branching bisimulation for context-free processes

  • Didier Caucal
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 652)

Abstract

The branching bisimulation defined by Van Glabbeek and Weijland takes care of preserving the branching structure of processes even though silent actions are taken. Branching bisimulation is obviously decidable for finite state processes. A proof that it is also decidable for reduced and proper context-free processes has been given by Hüttel. Going further along these lines, we prove that the class of reduced and proper context-free processes is closed under quotient by their greatest branching bisimulation.

Keywords

Label Transition System Finite Graph Graph Reduction Polynomial Time Hierarchy Sequential Congruence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBK 87]
    J. Baeten, J. Bergstra and J. KlopDecidability of bisimulation equivalence for processes generating context-free languages, PARLE 87, LNCS 259, pp. 94–111, 1987.Google Scholar
  2. [BK 88]
    J. Bergstra and J. KlopProcess theory based on bisimulation semantics, LNCS 354, pp. 50–122, 1988.Google Scholar
  3. [Bü 64]
    R. BüchiRegular canonical systems, Archiv für Mathematische Logik und Grundlagenforschung 6, pp. 91–111, 1964.Google Scholar
  4. [Ca 90 a]
    D. CaucalGraphes canoniques de graphes algébriques, RAIROTIA 24-4, pp. 339–352, 1990.Google Scholar
  5. [Ca 90 b]
    D. CaucalOn the regular structure of prefix rewriting, CAAP 90, LNCS 431, pp. 87–102, 1990, an extended version will appear in TCS A, Vol. 106, 1993.Google Scholar
  6. [CHT 92]
    D. Caucal, D. Huynh and L. Tian Deciding branching bisimilarity of normed context-free processes is in ∑P/2, Technical Report UTDCS-8-92, 1992.Google Scholar
  7. [CM 90]
    D. Caucal and R. MonfortOn the transition graphs of automata and grammars, WG 90, LNCS 484, pp. 311–337, 1990.Google Scholar
  8. [Co 83]
    B. CourcelleAn axiomatic approach to the KH algorithms, Mathematical System Theory 16, pp. 191–231, 1983.CrossRefGoogle Scholar
  9. [Co 90]
    B. Courcelle Graph rewriting: an algebraic and logic approach, Handbook of TCS, Vol. B, Elsevier, pp. 193–242, 1990.Google Scholar
  10. [GW 89]
    R. Van Glabbeek and P. Weijland Branching time and abstraction in bisimulation semantics, Proceedings 11th IFIP World Computer Congress, 1989.Google Scholar
  11. [GV 89]
    J. Groote and F. VaandragerStructured operational semantics and bisimulation as a congruence, ICALP 89, LNCS 372, pp. 423–438, 1989.Google Scholar
  12. [GV 90]
    J. Groote and F. VaandragerAn efficient algorithm for branching bisimulation and stuttering equivalence, ICALP 90, LNCS 443, pp. 626–638, 1990.Google Scholar
  13. [Hü 91]
    H. Hüttel Silence is golden: branching bisimilarity is decidable for context-free processes, Technical Report ECS-LFCS-91-173, CAV 91, to appear, 1991.Google Scholar
  14. [HS 91]
    H. Hüttel and C. Stirling Actions speak louder than words: proving bisimilarity for context-free processes, LICS 91, to appear, 1991.Google Scholar
  15. [HT 92]
    D. Huynh and L. Tian Deciding bisimilarity of normed context-free processes is in ∑2p, Technical Report UTDCS-1-92, to appear in TCS, 1992.Google Scholar
  16. [Pa 81]
    D. ParkConcurrency and automata on infinite sequences, LNCS 104, pp. 167–183, 1981.Google Scholar
  17. [St 77]
    L. StockmeyerThe polynomial time hierarchy, TCS 3, pp. 1–22, 1977.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Didier Caucal
    • 1
  1. 1.IRISARennesFrance

Personalised recommendations