Skip to main content
SpringerLink
Log in

Quantitative Verification and Control via the Mu-Calculus

  • Conference paper
CONCUR 2003 - Concurrency Theory (CONCUR 2003)

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

Included in the following conference series:

Abstract

Linear-time properties and symbolic algorithms provide a widely used framework for system specification and verification. In this framework, the verification and control questions are phrased as boolean questions: a system either satisfies (or can be made to satisfy) a property, or it does not. These questions can be answered by symbolic algorithms expressed in the μ-calculus. We illustrate how the μ-calculus also provides the basis for two quantitative extensions of this approach: a probabilistic extension, where the verification and control problems are answered in terms of the probability with which the specification holds, and a discounted extension, in which events in the near future are weighted more heavily than events in the far away future.

This research was supported in part by the NSF CAREER award CCR-0132780, the NSF grant CCR-0234690, and the ONR grant N00014-02-1-0671.

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. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating time temporal logic. J. ACM 49, 672–713 (2002)

    Article  MathSciNet  Google Scholar 

  2. Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 163–178. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Bhat, G., Cleaveland, R.: Efficient model checking via the equational μ-calculus. In: Proc. 11th IEEE Symp. Logic in Comp. Sci., pp. 304–312 (1996)

    Google Scholar 

  4. Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol. I and II. Athena Scientific (1995)

    Google Scholar 

  5. Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finitestate strategies. Trans. Amer. Math. Soc. 138, 295–311 (1969)

    Article  MathSciNet  Google Scholar 

  6. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)

    Article  Google Scholar 

  7. Condon, A.: The complexity of stochastic games. Information and Computation 96, 203–224 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. de Alfaro, L., Henzinger, T.A.: Concurrent omega-regular games. In: Proc. 15th IEEE Symp. Logic in Comp. Sci., pp. 141–154 (2000)

    Google Scholar 

  9. de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. In: Proc. 39th IEEE Symp. Found. of Comp. Sci., pp. 564–575. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  10. de Alfaro, L., Henzinger, T.A., Majumdar, R.: From verification to control: Dynamic programs for omega-regular objectives. In: Proc. 16th IEEE Symp. Logic in Comp. Sci., pp. 279–290. IEEE Press, Los Alamitos (2001)

    Chapter  Google Scholar 

  11. de Alfaro, L., Henzinger, T.A., Majumdar, R.: Symbolic algorithms for infinite-state games. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 536–550. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Proc. 30th Int. Colloq. Aut. Lang. Prog. Lect. Notes in Comp. Sci.. Springer, Heidelberg (2003)

    Google Scholar 

  13. de Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. In: Proc. 33rd ACM Symp. Theory of Comp., pp. 675–683. ACM Press, New York (2001)

    Google Scholar 

  14. Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled markov processes. Information and Computation 179(2), 163–193 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Derman, C.: Finite State Markovian Decision Processes. Academic Press, London (1970)

    MATH  Google Scholar 

  16. Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled markov systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 258–273. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proc. 17th IEEE Symp. Logic in Comp. Sci., pp. 413–422 (2002)

    Google Scholar 

  18. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: Proc. 32nd IEEE Symp. Found. of Comp. Sci., pp. 368–377. IEEE Computer Society Press, Los Alamitos (1991)

    Chapter  Google Scholar 

  19. Emerson, E.A., Lei, C.L.: Efficient model checking in fragments of the propositional μ-calculus. In: Proc. First IEEE Symp. Logic in Comp. Sci., pp. 267–278 (1986)

    Google Scholar 

  20. Everett, H.: Recursive games. In: Contributions to the Theory of Games III. Annals of Mathematical Studies, vol. 39, pp. 47–78 (1957)

    Google Scholar 

  21. Feldman, Y.A.: A decidable propositional probabilistic dynamic logic. In: Proc. 15th ACM Symp. Theory of Comp., pp. 298–309 (1983)

    Google Scholar 

  22. Feldman, Y.A., Harel, D.: A probabilistic dynamic logic. In: Proc. 14th ACM Symp. Theory of Comp., pp. 181–195 (1982)

    Google Scholar 

  23. Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  24. Huth, M., Kwiatkowska, M.: Quantitative analysis and model checking. In: Proc. 12th IEEE Symp. Logic in Comp. Sci., pp. 111–122 (1997)

    Google Scholar 

  25. Henzinger, T.A., Majumdar, R.: A classification of symbolic transition systems. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 13–34. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  26. Kozen, D.: A probabilistic PDL. In: Proc. 15th ACM Symp. Theory of Comp., pp. 291–297 (1983)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  28. Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov Chains. D. Van Nostrand Company (1966)

    Google Scholar 

  29. Martin, D.A.: The determinacy of Blackwell games. The Journal of Symbolic Logic 63(4), 1565–1581 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  30. Milner, R.: Operational and algebraic semantics of concurrent processes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 1202–1242. Elsevier Science Publishers, North-Holland (1990)

    Google Scholar 

  31. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York (1991)

    MATH  Google Scholar 

  32. Reif, J.H.: Logic for probabilistic programming. In: Proc. 12th ACM Symp. Theory of Comp., pp. 8–13 (1980)

    Google Scholar 

  33. Rosenthal, K.I.: Quantales and Their Applications. Pitman Research Notes in Mathematics Series, vol. 234. Longman Scientific & Technical, Harlow (1990)

    MATH  Google Scholar 

  34. Shapley, L.S.: Stochastic games. Proc. Nat. Acad. Sci. USA 39, 1095–1100 (1953)

    Article  MATH  MathSciNet  Google Scholar 

  35. Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. ch. 4, vol. B, pp. 135–191. Elsevier Science Publishers, North-Holland (1990)

    Google Scholar 

  36. Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995)

    Google Scholar 

  37. van Breugel, F., Worrel, J.: An algorithm for quantitative verification of probabilistic transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 336–350. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  38. van Breugel, F., Worrel, J.: Towards quantitative verification of probabilistic systems. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 421–432. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  39. von Neumann, J.: Zur Theorie der Gesellschaftsspiele. Math. Annal 100, 295–320 (1928)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, UC, Santa Cruz, USA

    Luca de Alfaro

Authors
  1. Luca de Alfaro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Paris 7, PPS, Case 7014, 75205, Paris Cedex 13, France

    Roberto Amadio

  2. LIF, CNRS, Aix-Marseille Université, France

    Denis Lugiez

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Alfaro, L. (2003). Quantitative Verification and Control via the Mu-Calculus. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45187-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation