Skip to main content
SpringerLink
Log in

Near-Optimal Scheduling for LTL with Future Discounting

  • Conference paper
  • First Online:
Trustworthy Global Computing (TGC 2015)

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

Included in the following conference series:

Abstract

We study the search problem for optimal schedulers for the linear temporal logic (LTL) with future discounting. The logic, introduced by Almagor, Boker and Kupferman, is a quantitative variant of LTL in which an event in the far future has only discounted contribution to a truth value (that is a real number in the unit interval [0, 1]). The precise problem we study—it naturally arises e.g. in search for a scheduler that recovers from an internal error state as soon as possible—is the following: given a Kripke frame, a formula and a number in [0, 1] called a margin, find a path of the Kripke frame that is optimal with respect to the formula up to the prescribed margin (a truly optimal path may not exist). We present an algorithm for the problem; it works even in the extended setting with propositional quality operators, a setting where (threshold) model-checking is known to be undecidable.

An extended version of the current paper, with further details and proofs, is found at [19].

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 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

References

  1. Abdeddaïm, Y., Asarin, E., Maler, O.: Scheduling with timed automata. Theor. Comput. Sci. 354(2), 272–300 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 15–27. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Almagor, S., Boker, U., Kupferman, O.: Discounting in LTL. In: Ábrahám, E., Havelund, K. (eds.) TACAS 2014 (ETAPS). LNCS, vol. 8413, pp. 424–439. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  4. Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. Extended version of [2], preprint (private communication) (2014)

    Google Scholar 

  5. Baier, C., Dubslaff, C., Klüppelholz, S.: Trade-off analysis meets probabilistic model checking. In: Henzinger, T.A., Miller, D. (eds.), CSL-LICS 2014, p. 1. ACM (2014)

    Google Scholar 

  6. Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140–156. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Bouyer, P., Markey, N., Matteplackel, R.M.: Averaging in LTL. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 266–280. Springer, Heidelberg (2014)

    Google Scholar 

  8. Černý, P., Chatterjee, K., Henzinger, T.A., Radhakrishna, A., Singh, R.: Quantitative synthesis for concurrent programs. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 243–259. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. Logical Methods Comput. Sci. 6(3), 1–23 (2010)

    MathSciNet  MATH  Google Scholar 

  10. Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: LICS 2005, pp. 178–187. IEEE Computer Society (2005)

    Google Scholar 

  11. Cheung, L., Stoelinga, M., Vaandrager, F.W.: A testing scenario for probabilistic processes. J. ACM 54(6) (2007). Article No. 29

    Google Scholar 

  12. 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, volume 2719 of LNCS, pp. 1022–1037. Springer (2003)

    Google Scholar 

  13. Droste, M., Rahonis, G.: Weighted automata and weighted logics with discounting. Theor. Comput. Sci. 410(37), 3481–3494 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Faella, M., Legay, A., Stoelinga, M.: Model checking quantitative linear time logic. Electr. Notes Theor. Comput. Sci. 220(3), 61–77 (2008)

    Article  MATH  Google Scholar 

  15. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Asp. Comput. 6(5), 512–535 (1994)

    Article  MATH  Google Scholar 

  16. Kupferman, O., Piterman, N., Vardi, M.Y.: Safraless compositional synthesis. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 31–44. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM 47(2), 312–360 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Miyano, S., Hayashi, T.: Alternating finite automata on omega-words. Theor. Comput. Sci. 32, 321–330 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  19. Nakagawa, S., Hasuo, I.: Near-optimal scheduling for LTL with future discounting (2015). CoRR, abs/1410.4950

  20. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 11–13, 1989, pp. 179–190. ACM Press (1989)

    Google Scholar 

  21. Rahonis, G.: Infinite fuzzy computations. Fuzzy Sets Syst. 153(2), 275–288 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  22. van Glabbeek, R.J.: The linear time-branching time spectrum I; the semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.), Handbook of Process Algebra, chapter 1, pp. 3–99. Elsevier (2001)

    Google Scholar 

  23. Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Logics for Concurrency: Structure Versus Automata, vol. 1043 of LNCS, pp. 238–266. Springer-Verlag (1996)

    Google Scholar 

Download references

Acknowledgments

Thanks are due to Shaull Almagor, Shuichi Hirahara, and the anonymous referees, for useful discussions and comments. The authors are supported by Grants-in-Aid No. 24680001, 15KT0012 and 15K11984, JSPS.

Author information

Authors and Affiliations

  1. University of Tokyo, Tokyo, Japan

    Shota Nakagawa & Ichiro Hasuo

Authors
  1. Shota Nakagawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ichiro Hasuo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ichiro Hasuo .

Editor information

Editors and Affiliations

  1. IMDEA Software Institute, Pozuelo de Alarcón, Madrid, Spain

    Pierre Ganty

  2. Università degli Studi di Firenze, Florence, Italy

    Michele Loreti

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Nakagawa, S., Hasuo, I. (2016). Near-Optimal Scheduling for LTL with Future Discounting. In: Ganty, P., Loreti, M. (eds) Trustworthy Global Computing. TGC 2015. Lecture Notes in Computer Science(), vol 9533. Springer, Cham. https://doi.org/10.1007/978-3-319-28766-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28766-9_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28765-2

  • Online ISBN: 978-3-319-28766-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation