1.
Abdeddaïm, Y., Asarin, E., Maler, O.: Scheduling with timed automata. Theor. Comput. Sci.
354(2), 272–300 (2006)
CrossRefMathSciNetMATH
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)
CrossRef
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)
CrossRef
4.
Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. Extended version of [2], preprint (private communication) (2014)
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)
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)
CrossRef
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)
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)
CrossRef
9.
Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. Logical Methods Comput. Sci.
6(3), 1–23 (2010)
MathSciNetMATH
10.
Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: LICS 2005, pp. 178–187. IEEE Computer Society (2005)
11.
Cheung, L., Stoelinga, M., Vaandrager, F.W.: A testing scenario for probabilistic processes. J. ACM
54(6) (2007). Article No. 29
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)
13.
Droste, M., Rahonis, G.: Weighted automata and weighted logics with discounting. Theor. Comput. Sci.
410(37), 3481–3494 (2009)
CrossRefMathSciNetMATH
14.
Faella, M., Legay, A., Stoelinga, M.: Model checking quantitative linear time logic. Electr. Notes Theor. Comput. Sci.
220(3), 61–77 (2008)
CrossRefMATH
15.
Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Asp. Comput.
6(5), 512–535 (1994)
CrossRefMATH
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)
CrossRef
17.
Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM
47(2), 312–360 (2000)
CrossRefMathSciNetMATH
18.
Miyano, S., Hayashi, T.: Alternating finite automata on omega-words. Theor. Comput. Sci.
32, 321–330 (1984)
CrossRefMathSciNetMATH
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)
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)
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)
