Skip to main content
SpringerLink
Log in

Grammars as Processes

  • Chapter
  • First Online:
Formal and Natural Computing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2300))

Abstract

In 1999 I met Grzegorz Rozenberg in Amsterdam, while I was attending the ETAPS conference and he was taking part in a meeting. The next day I was giving a talk with the title “Grammars as Processes”, and Grzegorz, who had seen it announced in the program, asked me about it. We had little time, and so I could barely sketch the contents. I think Grzegorz would have liked the talk, because it pointed out an interesting connection between two ofhis oldest loves, formal languages and concurrency theory, and showed how a model of computation derived from this connection has a natural application in the area of program analysis. He would have also liked to see how an abstract result obtained by Büchi in 1964 on regular canonical systems was the basis to new algorithms for the analysis of software. This paper is a written version oft he talk, and it also surveys the new results obtained since 1999. Sections 3 and 4 are taken from the Ph. D. Thesis of Richard Mayr [21], and have also been published in [22].

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, K. Etessami, and M. Yannanakis. Analysis of Recursive State Machines. In Proceedings of CAV’ 01, LNCS 2102:207–220, 2001.

    Google Scholar 

  2. J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol. 18, Cambridge University Press, 1990.

    Google Scholar 

  3. R. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, 1993.

    Google Scholar 

  4. J. R. Büchi. Regular Canonical Systems and Finite Automata. Arch. Math. Logik Grundlagenforschung, 6:91–111, 1964.

    Article  MATH  Google Scholar 

  5. J. R. Büchi and D. Siefkes. Finite Automata, Their Algebras and Grammars. Springer-Verlag, 1988.

    Google Scholar 

  6. O. Burkart and J. Esparza. More Infinite Results. EATCS Bulletin, 62:138–159, 1997.

    MATH  Google Scholar 

  7. D. Caucal. On the Regular Structure of Prefix Rewriting. Theoretical Computer Science, 106(1):61–86, November 1992.

    Article  MathSciNet  Google Scholar 

  8. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation Equivalence Is Decidable for All Basic Parallel Processes. In Proceedings of CONCUR’ 93, LNCS 715:143–157, 1993.

    Google Scholar 

  9. G. Delzanno. Automatic Verification of Parameterized Cache Coherence Protocols. In Proceedings of CAV’ 00, LNCS 1885:53–68, 2000.

    Google Scholar 

  10. J. Esparza. Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. Fundamenta Informatica, 31:13–26, 1997.

    MATH  MathSciNet  Google Scholar 

  11. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient Algorithms for Model Checking Pushdown Systems. In Proceedings of CAV’ 00, LNCS 1885:232–247, 2000.

    Google Scholar 

  12. J. Esparza and J. Knoop. An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis. Proceedings of FOSSACS’ 99, LNCS 1578:14–30, 1999.

    Google Scholar 

  13. J. Esparza, A. Finkel, and R. Mayr. On the Verification of Broadcast Protocols. In Proceedings of LICS’ 99, 352–359. IEEE Computer Society, 1999.

    Google Scholar 

  14. J. Esparza and A. Podelski. Efficient Algorithms for Pre and Post on Interprocedural Parallel Flow Graphs. In Proceedings of POPL’ 00, 1–11, ACM Press, 2000.

    Google Scholar 

  15. Y. Hirshfeld. Petri Nets and the Equivalence Problem. In Proceedings of CSL’ 93, LNCS 832:165–180, 1994.

    Google Scholar 

  16. J.E. Hopcroft, R. Motwani, and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2001.

    Google Scholar 

  17. D.T. Huynh. Commutative Grammars: The Complexity of Uniform Word Problems. Information and Control, 57(1):21–39, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  18. D.T. Huynh. The Complexity of Equivalence Problems for Commutative Grammars. Information and Control, 66(1/2):103–121, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Knoop. Optimal Interprocedural Program Optimization. LNCS 1428, 1998.

    Google Scholar 

  20. D. Lugiez and Ph. Schnoebelen. The Regular Viewpoint on PA-processes. In Proceedings of CONCUR’ 98, LNCS 1466:50–66, 1998.

    Google Scholar 

  21. R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Ph.D. thesis, Technische Universität München, 1998.

    Google Scholar 

  22. R. Mayr. Process Rewrite Systems. Information and Computation, 156(1/2):264–286, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  23. F. Moller. Infinite Results. In Proceedings of CONCUR’ 96, LNCS 1119:195–216, 1996.

    Google Scholar 

  24. M. Müller-Olm and H. Seidl. On Optimal Slicing of Parallel Programs. In Proceedings of STOC’ 01, 647–656, ACM Press, 2001.

    Google Scholar 

  25. G. Ramalingam. Context-Sensitive Synchronization-Sensitive Analysis Is Undecidable. ACM Transactions on Programming Languages and Systems, 22(2):416–430, 2000.

    Article  Google Scholar 

  26. D.A. Schmidt and B. Steffen. Program Analysis as Model Checking of Abstract Interpretations. In Proceedings of SAS’ 98, LNCS 1503:351–380, 1998.

    Google Scholar 

  27. D.A. Schmidt. Data Flow Analysis Is Model Checking of Abstract Interpretation. In Proceedings of POPL’ 98, 38–48, ACM Press, 1998.

    Google Scholar 

  28. H. Seidl and B. Steffen. Constraint-Based Inter-procedural Analysis of Parallel Programs. In Proceedings of ESOP’ 00, LNCS 1782:351–365, 2000.

    Google Scholar 

  29. B. Steffen. Data Flow Analysis as Model Checking. In Proceedings of TACS’ 91, LNCS 526:346–364, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Foundations of Computer Science Division of Informatics, University of Edinburgh, James Clerk Maxwell Building, Mayfield Road, EH9 3JZ, Edinburgh, UK

    Javier Esparza

Authors
  1. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technical University of Munich, Arcisstraße 21, 80333, Munich, Germany

    Wilfried Brauer

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  4. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Esparza, J. (2002). Grammars as Processes. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45711-9_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43190-9

  • Online ISBN: 978-3-540-45711-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation