References

  1. S. Almagor, U. Boker & O. Kupferman: Formally reasoning about quality. J. ACM 63(3), doi:10.1145/2875421.
  2. S. Almagor, U. Boker & O. Kupferman (2014): Discounting in LTL. In: E. Ábrahám & K. Havelund: TACAS 2014, LNCS 8413. Springer Berlin Heidelberg, pp. 424–439, doi:10.1007/978-3-642-54862-8_37.
  3. C. Baier & J. P. Katoen (2008): Principles of Model Checking. The MIT Press.
  4. J. Berstel & C. Reutenauer (1988): Rational Series and Their Languages. Springer, Berlin, doi:10.1007/978-3-642-73235-5. Available at http://www-igm.univ-mlv.fr/~berstel. (New revised English edition).
  5. P. Bouyer, N. Markey & R. M. Matteplackel (2014): Averaging in LTL. In: P. Baldan & D. Gorla: CONCUR 2014, LNCS 8704. Springer Berlin Heidelberg, pp. 266–280, doi:10.1007/978-3-662-44584-6_19.
  6. K. Chatterjee, L. Doyen & T. A. Henzinger (2010): Quantitative languages. ACM Trans. Comput. Log. 11(4), doi:10.1145/1805950.1805953.
  7. V. Diekert & P. Gastin (2008): First-order definable languages. In: J. Flum, E. Grädel & T. Wilke: Logic and Automata: History and Perspectives, Texts in Logic and Games 2. Amsterdam University Press, pp. 261–306. Available at http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-WT08.pdf.
  8. M. Droste & P. Gastin (2007): Weighted automata and weighted logics. Theoret. Comput. Sci. 380, pp. 69–86, doi:10.1016/j.tcs.2007.02.055.
  9. M. Droste & P. Gastin (2009): Weighted automata and weighted logics, chapter 5, in Dr:Han, doi:10.1007/978-3-642-01492-5_5.
  10. M. Droste, W. Kuich & G. Rahonis (2008): Multi-valued MSO logics over words and trees. Fund. Inform. 84, pp. 305–327.
  11. M. Droste, W. Kuich & H. Vogler (2009): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, Berlin Heidelberg.
  12. M. Droste & D. Kuske: Weighted automata. In: J.-E. Pin: Handbook: Automata: from Mathematics to Applications, chapter 4. Available at http://eiche.theoinf.tu-ilmenau.de/kuske/Submitted/weighted.pdf. To appear..
  13. M. Droste & I. Meinecke (2011): Weighted automata and regular expressions over valuation monoids. Internat. J. Found. Comput. Sci. 22, pp. 1829–1844, doi:10.1142/S0129054111009069.
  14. M. Droste & I. Meinecke (2012): Weighted automata and weighted MSO logics for average and long-time behaviors. Inform. and Comput. 220-221, pp. 44–59, doi:10.1016/j.ic.2012.10.001.
  15. M. Droste & H. Vogler (2012): Weighted automata and multi-valued logics over arbitrary bounded lattices. Theoret. Comput. Sci. 418, pp. 14–36, doi:10.1016/j.tcs.2011.11.008.
  16. S. Eilenberg (1974): Automata, Languages and Machines, vol. A. Academic Press..
  17. Z. Ésik & W. Kuich (2007): On iteration semiring-semimodule pairs. Semigroup Forum 75, pp. 129–159, doi:10.1007/s00233-007-0709-7.
  18. Z. Ésik & W. Kuich (2009): Finite automata, chapter 3, in Dr:Han, doi:10.1007/978-3-642-01492-5_3.
  19. P. Faymonville & M. Zimmermann (2014): Parametric linear dynamic logic. In: A. Peron & C. Piazza: GandALF 2014, EPTCS 161, pp. 60–73, doi:10.4204/EPTCS.161.8.
  20. P. Gastin & B. Monmege: A unifying survey on weighted logics and weighted automata. In: M. Droste, Z. Ésik & K. Larsen: Soft Computing. Special issue on Quantitative Models and Weighted Automata, doi:10.1007/s00500-015-1952-6. To appear.
  21. G. De Giacomo & M. Y. Vardi (2015): Synthesis for LTL and LDL on finite traces. In: IJCAI 2015, IJCAI/AAAI, pp. 1558–1564.
  22. G. De Giacomo & M.Y. Vardi (2013): Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI 2013, IJCAI/AAAI, pp. 854–860. Available at http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6997.
  23. D. Harel, D. Kozen & J. Tiuryn (2000): Dynamic Logic. MIT Press.
  24. W. Kuich (1997): Semirings and formal power series: Their relevance to formal languages and automata theory. In: G. Rozenberg & A. Salomaa: Handbook of Formal Languages, chapter 9 vol. 1. Springer, pp. 609–677, doi:10.1007/978-3-642-59136-5_9.
  25. O. Kupferman & Y. Lustig (2007): Lattice automata. In: B. Cook & A. Podelski: VMCI 2007, LNCS 4349. Springer Berlin Heidelberg, pp. 199–213, doi:10.1007/978-3-540-69738-1_14.
  26. M. Lahijanian, S. Almagor, D. Fried, L. E. Kavraki & M. Y. Vardi (2015): This time the robot settles for a cost: A quantitative approach to temporal logic planning with partial satisfaction. In: AAAI 2015, pp. 3664–3671.
  27. K. G. Larsen, R. Mardare & B. Xue (2015): Altenation-free weighted mu-calculus: Decidability and completeness. Electron. Notes Theor. Comput. Sci. 319, pp. 289–313, doi:10.1016/j.entcs.2015.12.018.
  28. E. Mandrali (2013): Weighted Computability with Discounting. Aristotle University of Thessaloniki, Thessaloniki 2013.. Available at http://users.auth.gr/elemandr/phdthesis_Mandrali.pdf.
  29. E. Mandrali & G. Rahonis (2014): On weighted first-order logics with discounting. Acta Inform. 51, pp. 61–106, doi:10.1007/s00236-013-0193-3.
  30. E. Mandrali & G. Rahonis (2015): Weighted first-order logics over semirings. Acta Cybernet. 22, pp. 435–483, doi:10.14232/actacyb.22.2.2015.13.
  31. I. Meinecke (2009): A weighted μ-calculus on words. In: V. Diekert & D. Nowotka: DLT 2009, LNCS 5583. Springer Berlin Heidelberg, pp. 384–395, doi:10.1007/978-3-642-02737-6_31.
  32. A. Muscholl & H. Petersen (1996): A note on the commutative closure of star-free languages. Inform. Process. Lett. 57, pp. 71–74, doi:10.1016/0020-0190(95)00187-5.
  33. G. Rahonis (2009): Fuzzy languages, chapter 12, in Dr:Han, doi:10.1007/978-3-642-01492-5_12.
  34. J. Sakarovitch (2009): Rational and recognisable power series, chapter 4, in Dr:Han, doi:10.1007/978-3-642-01492-5_ 12.
  35. M. Schützenberger (1961): On the definition of a family of automata. Information and Control 4(2-3), pp. 245–270, doi:10.1016/S0019-9958(61)80020-X.
  36. M. Schützenberger (1962): On a theorem of R. Jungen. Proc. Amer. Math. Soc. 13, pp. 885–890, doi:10.1090/S0002-9939-1962-0142781-7.
  37. W. Thomas (1994): Automata on infinite objects. In: J. van Leeuwen: Handbook of Theoretical Computer Science, chapter 4 vol. B. Elsevier, pp. 133–191.
  38. M. Y. Vardi (2011): The rise and fall of LTL. In: GandALF 2011, EPTCS 54, doi:10.4204/EPTCS.54.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org