Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2008: CONCUR 2008 - Concurrency Theory pp 98–113Cite as

A Context-Free Process as a Pushdown Automaton

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5201))

Abstract

A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using the rooted branching bisimulation and contrasimulation equivalences instead of language equivalence. In process theory, different from automata theory, interaction is explicit, so we realize a pushdown automaton as a regular process communicating with a stack.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aceto, L., Fokkink, W.J., Verhoef, C.: Structural operational semantics. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 197–292. North-Holland, Amsterdam (2001)

    Chapter  Google Scholar 

  2. Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge University Press, Cambridge (2008)

    Google Scholar 

  3. Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: On the consistency of Koomen’s fair abstraction rule. Theoretical Computer Science 51(1–2), 129–176 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  4. Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM 40(3), 653–682 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Baeten, J.C.M., Bravetti, M.: A ground-complete axiomatization of finite state processes in process algebra. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 246–262. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge University Press, Cambridge (1990)

    Google Scholar 

  7. Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control 60(1/3), 109–137 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bosscher, D.J.B.: Grammars modulo bisimulation. Ph.D. thesis. University of Amsterdam (1997)

    Google Scholar 

  9. Caucal, D.: Branching bisimulation for context-free processes. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol. 652, pp. 316–327. Springer, Heidelberg (1992)

    Google Scholar 

  10. Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation equivalence is decidable for basic parallel processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 143–157. Springer, Heidelberg (1993)

    Google Scholar 

  11. Christensen, S., Hüttel, H., Stirling, C.: Bisimulation equivalence is decidable for all context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 138–147. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  12. van Glabbeek, R.J.: The linear time – branching time spectrum ii. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66–81. Springer, Heidelberg (1993)

    Google Scholar 

  13. van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), 555–600 (1996)

    Article  MathSciNet  Google Scholar 

  14. Groote, J.F., Reniers, M.A.: Algebraic process verification. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 1151–1208. North-Holland, Amsterdam (2001)

    Chapter  Google Scholar 

  15. Luttik, B.: Choice quantification in process algebra, Ph.D. thesis. University of Amsterdam (2002)

    Google Scholar 

  16. Moller, F.: The importance of the left merge operator in process algebras. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 752–764. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  17. Moller, F.: Infinite results. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 195–216. Springer, Heidelberg (1996)

    Google Scholar 

  18. Srba, J.: Deadlocking states in context-free process algebra. In: Brim, L., Gruska, J., Zlatuska, J. (eds.) MFSC 1998. LNCS, vol. 1450, pp. 388–398. Springer, Heidelberg (1998)

    Google Scholar 

  19. Voorhoeve, M., Mauw, S.: Impossible futures and determinism. Information Processing Letters 80(1), 51–58 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    J. C. M. Baeten, P. J. L. Cuijpers & P. J. A. van Tilburg

Authors
  1. J. C. M. Baeten
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. J. L. Cuijpers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. J. A. van Tilburg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franck van Breugel Marsha Chechik

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baeten, J.C.M., Cuijpers, P.J.L., van Tilburg, P.J.A. (2008). A Context-Free Process as a Pushdown Automaton. In: van Breugel, F., Chechik, M. (eds) CONCUR 2008 - Concurrency Theory. CONCUR 2008. Lecture Notes in Computer Science, vol 5201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85361-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85361-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85360-2

  • Online ISBN: 978-3-540-85361-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation