Skip to main content
SpringerLink
Log in
Book cover

Principles of Modeling pp 143–161Cite as

Computing Average Response Time

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10760))

Abstract

Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms.

This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., Raskin, J.: Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38(2), 97–118 (2011). https://doi.org/10.1007/s10703-010-0105-x

    Article  MATH  Google Scholar 

  2. Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM TOCL 11(4), 23 (2010)

    Article  MathSciNet  Google Scholar 

  3. Chatterjee, K., Henzinger, M.: An O(n\({}^{\text{2}}\)) time algorithm for alternating Büchi games. In: SODA 2012, pp. 1386–1399. ACM-SIAM (2012)

    Google Scholar 

  4. Chatterjee, K., Henzinger, M.: Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. J. ACM 61(3), 15:1–15:40 (2014)

    Article  Google Scholar 

  5. Chatterjee, K., Henzinger, T.A., Otop, J.: Bidirectional nested weighted automata. In: CONCUR 2017 (to appear)

    Google Scholar 

  6. Chatterjee, K., Henzinger, T.A., Otop, J.: Nested weighted automata. In: LICS 2015, pp. 725–737 (2015)

    Google Scholar 

  7. Chatterjee, K., Henzinger, T.A., Otop, J.: Nested weighted limit-average automata of bounded width. In: MFCS 2016, pp. 24:1–24:14 (2016). https://doi.org/10.4230/LIPIcs.MFCS.2016.24

  8. Chatterjee, K., Henzinger, T.A., Otop, J.: Quantitative automata under probabilistic semantics. In: LICS 2016, pp. 76–85 (2016). https://doi.org/10.1145/2933575.2933588

  9. Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01492-5

    Book  MATH  Google Scholar 

  10. Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Theory 8(2), 109–113 (1979)

    Article  MathSciNet  Google Scholar 

  11. Feller, W.: An Introduction to Probability Theory and its Applications. Wiley, Hoboken (1971)

    MATH  Google Scholar 

  12. Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, New York (1996). https://doi.org/10.1007/978-1-4612-4054-9

    Book  MATH  Google Scholar 

  13. Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math. 23(3), 309–311 (1978)

    Article  MathSciNet  Google Scholar 

  14. Martin, D.A.: Borel determinacy. Ann. Math. 102(2), 363–371 (1975). Second Series

    Article  MathSciNet  Google Scholar 

  15. McDermid, J.A.: Software Engineer’s Reference Book. Elsevier, Amsterdam (2013)

    Google Scholar 

  16. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158(1), 343–359 (1996)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IST Austria, Klosterneuburg, Austria

    Krishnendu Chatterjee & Thomas A. Henzinger

  2. University of Wrocław, Wrocław, Poland

    Jan Otop

Authors
  1. Krishnendu Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas A. Henzinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Otop
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas A. Henzinger .

Editor information

Editors and Affiliations

  1. University of California, Berkeley, Berkeley, California, USA

    Marten Lohstroh

  2. National Instruments, Berkeley, California, USA

    Patricia Derler

  3. Mälardalen University, Västerås, Sweden, Reykjavík University, Reykjavik, Iceland

    Marjan Sirjani

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chatterjee, K., Henzinger, T.A., Otop, J. (2018). Computing Average Response Time. In: Lohstroh, M., Derler, P., Sirjani, M. (eds) Principles of Modeling. Lecture Notes in Computer Science(), vol 10760. Springer, Cham. https://doi.org/10.1007/978-3-319-95246-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-95246-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-95245-1

  • Online ISBN: 978-3-319-95246-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation