Advertisement

Decidability of bisimulation equivalence for processes generating context-free languages

  • J. C. M. Baeten
  • J. A. Bergstra
  • J. W. Klop
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 259)

Abstract

A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can be assigned as solution, which has as its set of finite traces the context-free language (CFL) determined by that CFG. While the equality problem for CFL's is unsolvable, the equality problem for the processes determined by CFG's turns out to be solvable. Here equality on processes is given by a model of process graphs modulo bisimulation equivalence. The proof is given by displaying a periodic structure of the process graphs determined by CFG's. As a corollary of the periodicity a short proof of the solvability of the equivalence problem for simple context-free languages is given.

Keywords

Equality Problem Recursion Equation Process Algebra Communicate Sequential Process Trace Semantic 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BB]
    J.C.M. Baeten, J.A. Bergstra, Global renaming operators in concrete process algebra, Report CS-R8521, Centre for Mathematics and Computer Science, Amsterdam 1985.Google Scholar
  2. [BBK 1]
    J.C.M. Baeten, J.A. Bergstra, J.W. Klop, On the consistency of Koomen's Fair Abstraction Rule, Report CS-R8511, Centre for Mathematics and Computer Science, Amsterdam 1985. To appear in Theoret. Comput. Sci.Google Scholar
  3. [BBK 2]
    J.C.M. Baeten, J.A. Bergstra, J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, Report CS-R8632, Centre for Mathematics and Computer Science, Amsterdam 1986.Google Scholar
  4. [BBKM]
    J.W. de Bakker, J.A. Bergstra, J.W. Klop, J.-J.Ch. Meyer, Linear time and branching time semantics for recursion with merge, in: Proc. 10th ICALP, Barcelona (J. Díaz, Ed.), Springer LNCS 154, 39–51, 1983; expanded version: Theoret. Comput. Sci. 34 (1984) 135–156.Google Scholar
  5. [BHR]
    S.D. Brookes, C.A.R. Hoare, W. Roscoe, A Theory of Communicating Sequential Processes, J. Assoc. Comput. Mach. 31, No.3, 560–599.Google Scholar
  6. [BK 1]
    J.A. Bergstra, J.W. Klop, Process algebra for synchronous communication, Inform. and Control 60 (1984) 109–137.CrossRefGoogle Scholar
  7. [BK 2]
    J.A. Bergstra, J.W. Klop, Algebra of communicating processes, in: J.W. de Bakker, M. Hazewinkel, J.K. Lenstra, Eds., Proc. CWI Symp. Math. and Comp. Sci., North-Holland, Amsterdam 1986.Google Scholar
  8. [BK 3]
    J.A. Bergstra, J.W. Klop, The algebra of recursively defined processes and the algebra of regular processes, in: Proc. 11th ICALP, Antwerpen (J. Paredaens, Ed.), Springer LNCS 172, 82–94, 1984.Google Scholar
  9. [BKO]
    J.A. Bergstra, J.W. Klop, E.-R. Olderog, Readies and failures in the algebra of communicating processes, Report CS-R8523, Centre for Mathematics and Computer Science, Amsterdam 1985.Google Scholar
  10. [BMOZ]
    J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog, J.I. Zucker, Transition systems, infinitary languages and the semantics of uniform concurrency, in: Proc. 17th ACM STOC, Providence, R.I., 1985.Google Scholar
  11. [Ha]
    M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley 1978.Google Scholar
  12. [Ho]
    C.A.R. Hoare, A model for communicating sequential processes, in: "On the Construction of Programs" (R.M. McKeag and A.M. McNaughton, Eds.), 229–243, Cambridge Univ. Press, London/New York.Google Scholar
  13. [HU]
    J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley 1979.Google Scholar
  14. [KH]
    A.J. Korenjak, J.E. Hopcroft, Simple deterministic languages, Proc. of 7th Annual Symposium on Switching and Automata Theory, Berkeley, 36–46, 1966.Google Scholar
  15. [Me]
    J.-J.Ch. Meyer, Programming calculi based on fixed point transformations: semantics and applications, Ph.D. Thesis, Free University, Amsterdam 1985.Google Scholar
  16. [Mi 1]
    R. Milner, A calculus of communicating systems, Springer LNCS 92, 1980.Google Scholar
  17. [Mi 2]
    R. Milner, A complete inference system for a class of regular behaviours, J. Comput. and Syst. Sci. 28, 439–466, 1984.CrossRefGoogle Scholar
  18. [Pa]
    D. Park, Concurrency and automata on infinite sequences, in: P. Deussen, Ed., Proc. 5th GI Conf. on Theor. Comp. Sci., Springer LNCS 104 (1981).Google Scholar
  19. [Sa 1]
    A. Salomaa, Computation and automata, Cambridge University Press 1985.Google Scholar
  20. [Sa 2]
    A. Salomaa, Formal languages, Academic Press, N.Y., 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • J. C. M. Baeten
    • 1
  • J. A. Bergstra
    • 1
    • 2
  • J. W. Klop
    • 3
  1. 1.Computer Science DepartmentUniversity of AmsterdamThe Netherlands
  2. 2.Department of PhilosophyState University of UtrechtThe Netherlands
  3. 3.Centre for Mathematics and Computer ScienceAmsterdam

Personalised recommendations