Skip to main content
SpringerLink
Log in

Fixed points of Büchi automata

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992)

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

Abstract

We give a new and direct proof of the equivalence between the linear time μ-calculus νTL and Büchi automata. Constructions on automata are given which compute their least and greatest fixed points. Together with other well-known constructions corresponding to the remaining νTL connectives the result is a representation of νTL as Büchi automata which in contrast to previously known constructions is both elementary and compositional. Applications to the problem of completely axiomatising νTL are discussed.

Research supported by SERC grant GR/F 32219.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Alpern and F. B. Schneider. Verifying temporal properties without temporal logic. ACM Transactions on Programming Languages, 11:147–167, 1989.

    Article  Google Scholar 

  2. B. Banieqbal and H. Barringer. Temporal logic with fixed points. In Coll. Temporal Logic in Specification, Lecture Notes in Computer Science, 398:62–74, 1987.

    Google Scholar 

  3. J. R. Büchi. On a decision method in restricted second-order arithmetic. In Proc. International Congress on Logic, Methodology and Philosophy of Science, 1962.

    Google Scholar 

  4. M. Dam. CTL* and ECTL* as fragments of the modal mu-calculus. In Proc. 17th Coll. Trees in Algebra and Programming, Lecture Notes in Computer Science, 581:145–164, 1992.

    Google Scholar 

  5. R. Kuiper H. Barringer and A. Pnueli. Now you may compose temporal logic specification. In Proc. ACM Symp. Theory of Computing, pages 51–63, 1984.

    Google Scholar 

  6. N. Klarlund. Progress measures for complementation of ω-automata with applications to temporal logic. In Proc. 32nd Ann. Symp. Foundations of Computer Science, pages 358–367, 1991.

    Google Scholar 

  7. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–354, 1983.

    Article  Google Scholar 

  8. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In Proc. 6th Ann. Symp. Logic in Computer Science, pages 214–225, 1991.

    Google Scholar 

  9. R. Kurshan. Analysis of discrete event coordination. In Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, Lecture Notes in Computer Science, 430:414–453, 1990.

    Google Scholar 

  10. A. R. Meyer. Weak monadic second order theory of successor is not elementary recursive. Lecture Notes in Mathematics, 453:132–154, 1975.

    Google Scholar 

  11. M. Michel. Complementation is more difficult with automata on infinite words. Manuscript, 1988.

    Google Scholar 

  12. D. Park. Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 104:167–183, 1981.

    Google Scholar 

  13. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. Foundations of Computer Science, pages 319–327, 1988.

    Google Scholar 

  14. D. Siefkes. Büchi's Monadic Second Order Successor Arithmetic. Lecture Notes in Mathematics, 120. Springer-Verlag, 1970.

    Google Scholar 

  15. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89:161–177, 1991.

    Article  Google Scholar 

  16. R. S. Streett and E. A. Emerson. An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation, 81:249–264, 1989.

    Article  Google Scholar 

  17. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), North-Holland, 1989.

    Google Scholar 

  18. M. Y. Vardi. A temporal fixpoint calculus. In Proc. 15th Ann. ACM Symp. Principles of Programming Languages, pages 250–259, 1988.

    Google Scholar 

  19. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. Logic in Computer Science, pages 332–344, 1986.

    Google Scholar 

  20. G. Winskel. Model checking the modal ν-calculus. Lecture Notes in Computer Science, 372, 1989.

    Google Scholar 

Download references

Author information

Author notes

  1. Mads Dam

    Present address: Swedish Institute of Computer Science, Box 1263, S-164 28, Kista, Sweden

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, UK

    Mads Dam

Authors
  1. Mads Dam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mads Dam .

Editor information

Rudrapatna Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dam, M. (1992). Fixed points of Büchi automata. In: Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1992. Lecture Notes in Computer Science, vol 652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56287-7_93

Download citation

  • DOI: https://doi.org/10.1007/3-540-56287-7_93

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56287-0

  • Online ISBN: 978-3-540-47507-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation