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.
Keywords
- Average Response Time (ART)
- Game Graph
- Mean-payoff Objectives
- Basic Computational Questions
- Pending Requests
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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
Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM TOCL 11(4), 23 (2010)
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)
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)
Chatterjee, K., Henzinger, T.A., Otop, J.: Bidirectional nested weighted automata. In: CONCUR 2017 (to appear)
Chatterjee, K., Henzinger, T.A., Otop, J.: Nested weighted automata. In: LICS 2015, pp. 725–737 (2015)
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
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
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
Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Theory 8(2), 109–113 (1979)
Feller, W.: An Introduction to Probability Theory and its Applications. Wiley, Hoboken (1971)
Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, New York (1996). https://doi.org/10.1007/978-1-4612-4054-9
Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math. 23(3), 309–311 (1978)
Martin, D.A.: Borel determinacy. Ann. Math. 102(2), 363–371 (1975). Second Series
McDermid, J.A.: Software Engineer’s Reference Book. Elsevier, Amsterdam (2013)
Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158(1), 343–359 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
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)