Skip to main content
SpringerLink
Log in

How to Fix It: Using Fixpoints in Different Contexts

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3452))

  • 522 Accesses

Abstract

In this note we discuss the expressive power of μ-calculi. We concentrate on those that are extensions of propositional modal logics with a fixpoint operator. The objective is to try to match the expressive power of monadic second-order logic. We consider different kinds of models: from trees and transition systems up to traces and timed systems.

Work supported by the ACI Sécurité Informatique VERSYDIS.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alur, R., Fix, L., Henzinger, T.: Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science 204 (1997)

    Google Scholar 

  3. Arnold, A., Niwiñski, D.: The Rudiments of the Mu-Calculus. Studies in Logic, vol. 146. North-Holland, Amsterdam (2001)

    Google Scholar 

  4. Ebinger, W.: Logical definability of trace languages. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, pp. 382–390. World Scientific, Singapore (1995)

    Google Scholar 

  5. Gastin, P., Petit, A.: Infninite traces. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, World Scientific, Singapore (1995)

    Google Scholar 

  6. Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 263–277. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  7. Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 250–265. Springer, Heidelberg (2005) (to appear)

    Chapter  Google Scholar 

  8. Niwiński, D.: Fixed points vs. infinite generation. In: LICS 1988, pp. 402–409 (1988)

    Google Scholar 

  9. Shelah, S.: The monadic second order theory of order. Annals of Mathematics 102, 379–419 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  10. Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, Heidelberg (2001)

    Google Scholar 

  11. Walukiewicz, I.: Local logics for traces. Journal of Automata, Languages and Combinatorics 7(2), 259–290 (2002)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université Bordeaux-1, 351, Cours de la Libération, F-33 405, Talence cedex, France

    Igor Walukiewicz

Authors
  1. Igor Walukiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Theoretical Computer Science, TU Dresden, Germany

    Franz Baader

  2. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walukiewicz, I. (2005). How to Fix It: Using Fixpoints in Different Contexts. In: Baader, F., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32275-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32275-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25236-8

  • Online ISBN: 978-3-540-32275-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation