1. A. Arnold & D. Niwiński (2001): Rudiments of μ-Calculus. Studies in Logic and the Foundations of Mathematics. North-Holland.
  2. P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey & J Srba (2008): Infinite Runs in Weighted Timed Automata with Energy Constraints. In: F. Cassez & C. Jard: Formal Modelling and Analysis of Timed Systems, Lecture Notes in Computer Science 5215. Springer, pp. 33–47, doi:10.1007/978-3-540-85778-5_4.
  3. K. Chatterjee & L. Doyen (2012): Energy parity games. Theor. Comput. Sci. 458, pp. 49 – 60, doi:10.1016/j.tcs.2012.07.038.
  4. K. Chatterjee, T. A. Henzinger & M. Jurdzinski (2005): Mean-payoff parity games. In: Proceedings - Symposium on Logic in Computer Science 20, pp. 178 – 187, doi:10.1109/LICS.2005.26.
  5. C. Cîrstea: Linear Time Logics – A Coalgebraic Perspective. ArXiv:1612.07844.
  6. C. Cîrstea (2014): A Coalgebraic Approach to Linear-Time Logics. In: A. Muscholl: Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Lecture Notes in Computer Science 8412. Springer, pp. 426–440, doi:10.1007/978-3-642-54830-7_28.
  7. C. Cîrstea (2017): From Branching to Linear Time, Coalgebraically. Fundam. Inform. 150(3-4), pp. 379–406, doi:10.3233/FI-2017-1474.
  8. C. Cîrstea, S. Shimizu & I. Hasuo (2017): Parity Automata for Quantitative Linear Time Logics. In: F. Bonchi & B. König: CALCO'17, Leibniz International Proceedings in Informatics (LIPIcs) 72. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp. 1–18, doi:10.4230/LIPIcs.CALCO.2017.7.
  9. N. Fijalkow & M. Zimmermann (2014): Parity and Streett Games with Costs. Logical Methods in Computer Science 10, pp. 1–29, doi:10.2168/LMCS-10(2:14)2014.
  10. E. Grädel, W. Thomas & T. Wilke (2002): Automata, Logics, and Infinite Games: A Guide to Current Research. Lecture Notes in Computer Science 2500. Springer, doi:10.1007/3-540-36387-4.
  11. B. Jacobs (2016): Introduction to Coalgebra. Towards Mathematics of States and Observations. Cambridge University Press, doi:10.1017/CBO9781316823187.
  12. M. Jurdziński (2000): Small Progress Measures for Solving Parity Games. In: H. Reichel & S. Tison: STACS 2000, Lecture Notes in Computer Science 1770. Springer, pp. 290–301, doi:10.1007/3-540-46541-3_24.
  13. S. Schewe, A. Weinert & M. Zimmermann (2018): Parity Games with Weights. In: D. Ghica & A. Jung: 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), Leibniz International Proceedings in Informatics (LIPIcs) 119. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp. 36:1–36:17, doi:10.4230/LIPIcs.CSL.2018.36.

Comments and questions to:
For website issues: