Skip to main content
SpringerLink
Log in

A Weighted μ-Calculus on Words

  • Conference paper
Developments in Language Theory (DLT 2009)

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

Included in the following conference series:

Abstract

We define a weighted μ-calculus on finite and infinite words. Hereby, the μ-calculus does not use conjunction and the weights are taken from semirings satisfying certain completeness and continuity properties. For important semirings like distributive complete lattices, the tropical and the probabilistic semiring, we show that the formulas of the conjunction-free weighted μ-calculus define exactly the class of omega-rational formal power series.

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. Arnold, A., Niwiński, D.: Fixed point characterization of weak monadic logic definable set of trees. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages, pp. 159–188. Elsevier, Amsterdam (1992)

    Google Scholar 

  2. Arnold, A., Niwiński, D.: Rudiments of μ-Calculus. Studies in Logic and the Foundations of Mathematics, vol. 146. North-Holland, Amsterdam (2001)

    MATH  Google Scholar 

  3. Bruns, G., Godefroid, P.: Model checking with multi-valued logics. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 281–293. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1022–1037. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoretical Computer Science 380, 69–86 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Droste, M., Kuich, W.: Semirings and formal power series. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, ch. 1. Springer, Heidelberg (to appear, 2009)

    Chapter  Google Scholar 

  7. Droste, M., Kuich, W., Rahonis, G.: Multi-valued MSO logics over words and trees. Fundamenta Informaticae 84, 305–327 (2008)

    MathSciNet  MATH  Google Scholar 

  8. Droste, M., Kuske, D.: Skew and infinitary formal power series. Theoretical Computer Science 366, 199–227 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Droste, M., Püschmann, U.: On weighted Büchi automata with order-complete weights. Algebra and Computation 17(2), 235–260 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Droste, M., Rahonis, G.: Weighted automata and weighted logics on infinite words. Izvestiya VUZ. Matematika (2008)

    Google Scholar 

  11. Ésik, Z., Kuich, W.: A semiring-semimodule generalization of ω-regular languages I and II. J. of Automata, Languages and Combinatorics 10(2/3), 203–242, 243–264 (2005)

    MathSciNet  MATH  Google Scholar 

  12. Fainekos, G.E.: An introduction to multi-valued model checking. Technical Report MS-CIS-05-16, Dept. of CIS, University of Pennsylvania (September 2005)

    Google Scholar 

  13. Fischer, D., Grädel, E., Kaiser, Ł.: Model checking games for the quantitative μ-calculus. In: Proceedings of STACS 2008, pp. 301–312 (2008)

    Google Scholar 

  14. Grätzer, G.: General Lattice Theory, 2nd edn. Birkhäuser, Basel (2003)

    MATH  Google Scholar 

  15. Gurfinkel, A., Chechik, M.: Multi-valued model checking via classical model checking. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 266–280. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27, 333–354 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoret. Comp. Sc, vol. 5. Springer, Heidelberg (1986)

    Book  MATH  Google Scholar 

  18. Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 199–213. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  20. Schützenberger, M.: On the definition of a family of automata. Information and Control 4, 245–270 (1961)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Leipzig, D-04109, Leipzig, Germany

    Ingmar Meinecke

Authors
  1. Ingmar Meinecke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Formale Methoden der Informatik, FMI, Universität Stuttgart, Universitätsstrasse 38, 70569, Stuttgart, Germany

    Volker Diekert  & Dirk Nowotka  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meinecke, I. (2009). A Weighted μ-Calculus on Words. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02737-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02736-9

  • Online ISBN: 978-3-642-02737-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation