References

  1. R. Iris Bahar, Erica A. Frohm, Charles M. Gaona, Gary D. Hachtel, Enrico Macii, Abelardo Pardo & Fabio Somenzi (1997): Algebraic Decision Diagrams and Their Applications. Formal Methods in System Design 10(2/3), pp. 171–206, doi:10.1023/A:1008699807402.
  2. Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger & Barbara Jobstmann (2009): Better Quality in Synthesis through Quantitative Objectives. In: Bouajjani & Maler, pp. 140–156, doi:10.1007/978-3-642-02658-4_14.
  3. Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin & Jean-François Raskin (2012): Acacia+, a Tool for LTL Synthesis. In: CAV, LNCS 7358. Springer, pp. 652–657, doi:10.1007/978-3-642-31424-7_45.
  4. Aaron Bohy, Véronique Bruyère, Emmanuel Filiot & Jean-François Raskin (2013): Synthesis from LTL Specifications with Mean-Payoff Objectives. In: Nir Piterman & Scott A. Smolka: Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, Lecture Notes in Computer Science 7795. Springer, pp. 169–184, doi:10.1007/978-3-642-36742-7_12.
  5. Ahmed Bouajjani & Oded Maler (2009): Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings. Lecture Notes in Computer Science 5643. Springer, doi:10.1007/978-3-642-02658-4.
  6. Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey & JiríSrba (2008): Infinite Runs in Weighted Timed Automata with Energy Constraints. In: Formal Modeling and Analysis of Timed Systems, 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008. Proceedings, pp. 33–47, doi:10.1007/978-3-540-85778-5_4.
  7. Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini & Jean-François Raskin (2011): Faster algorithms for mean-payoff games. Formal Methods in System Design 38(2), pp. 97–118, doi:10.1007/s10703-010-0105-x.
  8. Randal E. Bryant (1986): Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Computers 35(8), pp. 677–691, doi:10.1109/TC.1986.1676819.
  9. Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger & Jean-François Raskin (2010): Generalized Mean-payoff and Energy Games. In: Kamal Lodaya & Meena Mahajan: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, LIPIcs 8. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 505–516, doi:10.4230/LIPIcs.FSTTCS.2010.505. Available at http://drops.dagstuhl.de/opus/portals/extern/index.php?semnr=10007.
  10. Krishnendu Chatterjee, Mickael Randour & Jean-François Raskin (2014): Strategy synthesis for multi-dimensional quantitative objectives. Acta Inf. 51(3-4), pp. 129–163, doi:10.1007/s00236-013-0182-6.
  11. J. Crampton & G. Loizou (2001): The completion of a poset in a lattice of antichains. International Mathematical Journal 1(3), pp. 223–238. Available at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.5671.
  12. Laurent Doyen & Jean-François Raskin (2010): Antichain Algorithms for Finite Automata. In: Javier Esparza & Rupak Majumdar: Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings, Lecture Notes in Computer Science 6015. Springer, pp. 2–22, doi:10.1007/978-3-642-12002-2_2.
  13. A. Ehrenfeucht & J. Mycielski (1979): Positional strategies for mean payoff games. International Journal of Game Theory 8(2), pp. 109–113, doi:10.1007/BF01768705.
  14. Emmanuel Filiot, Naiyong Jin & Jean-François Raskin (2009): An Antichain Algorithm for LTL Realizability. In: Bouajjani & Maler, pp. 263–277, doi:10.1007/978-3-642-02658-4_22.
  15. Masahiro Fujita, Patrick C. McGeer & Jerry Chih-Yuan Yang (1997): Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation. Formal Methods in System Design 10(2/3), pp. 149–169, doi:10.1023/A:1008647823331.
  16. Michael Huth & Mark Dermot Ryan (2004): Logic in computer science - modelling and reasoning about systems (2. ed.). Cambridge University Press, doi:10.1017/CBO9780511810275.
  17. Shahar Maoz & Jan Oliver Ringert (2015): GR(1) synthesis for LTL specification patterns. In: ESEC/FSE. ACM, pp. 96–106, doi:10.1145/2786805.2786824.
  18. Shahar Maoz & Jan Oliver Ringert (2015): Synthesizing a Lego Forklift Controller in GR(1): A Case Study. In: Proc. 4th Workshop on Synthesis, SYNT 2015 colocated with CAV 2015, EPTCS 202, pp. 58–72, doi:10.4204/EPTCS.202.5.
  19. Amir Pnueli & Roni Rosner (1989): On the Synthesis of a Reactive Module. In: POPL. ACM Press, pp. 179–190, doi:10.1145/75277.75293.
  20. Amir Pnueli, Yaniv Sa'ar & Lenore D. Zuck (2010): JTLV: A Framework for Developing Verification Algorithms. In: CAV, LNCS 6174. Springer, pp. 171–174, doi:10.1007/978-3-642-14295-6_18.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org