References

  1. Luca de Alfaro, Thomas A. Henzinger & Orna Kupferman (2007): Concurrent reachability games. Theor. Comput. Sci. 386(3), pp. 188–217. Available at http://dx.doi.org/10.1016/j.tcs.2007.07.008.
  2. Rajeev Alur, Thomas A. Henzinger & Orna Kupferman (2002): Alternating-time temporal logic. J. ACM 49(5), pp. 672–713. Available at http://doi.acm.org/10.1145/585265.585270.
  3. Tomás Brázdil, Petr Jancar & Antonín Kucera (2010): Reachability Games on Extended Vector Addition Systems with States. In: Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide & Paul G. Spirakis: ICALP (2), Lecture Notes in Computer Science 6199. Springer, pp. 478–489. Available at http://dx.doi.org/10.1007/978-3-642-14162-1_40.
  4. Ashok K. Chandra, Dexter Kozen & Larry J. Stockmeyer (1981): Alternation. J. ACM 28(1), pp. 114–133, doi:10.1145/322234.322243.
  5. Javier Esparza & Jörg Desel (2013): On Negotiation as Concurrency Primitive. In: Pedro R. D'Argenio & Hernán C. Melgratti: CONCUR, Lecture Notes in Computer Science 8052. Springer, pp. 440–454. Available at http://dx.doi.org/10.1007/978-3-642-40184-8_31.
  6. Javier Esparza & Jörg Desel (2014): On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations. In: Anca Muscholl: FoSSaCS, Lecture Notes in Computer Science 8412. Springer, pp. 258–273. Available at http://dx.doi.org/10.1007/978-3-642-54830-7_17.
  7. Paul Gastin, Nathalie Sznajder & Marc Zeitoun (2009): Distributed synthesis for well-connected architectures. Formal Methods in System Design 34(3), pp. 215–237. Available at http://dx.doi.org/10.1007/s10703-008-0064-7.
  8. Blaise Genest, Hugo Gimbert, Anca Muscholl & Igor Walukiewicz (2013): Asynchronous Games over Tree Architectures. In: Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska & David Peleg: ICALP (2), Lecture Notes in Computer Science 7966. Springer, pp. 275–286. Available at http://dx.doi.org/10.1007/978-3-642-39212-2_26.
  9. Antonín Kucera (2012): Playing Games with Counter Automata. In: Alain Finkel, Jérôme Leroux & Igor Potapov: RP, Lecture Notes in Computer Science 7550. Springer, pp. 29–41. Available at http://dx.doi.org/10.1007/978-3-642-33512-9_4.
  10. Swarup Mohalik & Igor Walukiewicz (2003): Distributed Games. In: Paritosh K. Pandya & Jaikumar Radhakrishnan: FSTTCS, Lecture Notes in Computer Science 2914. Springer, pp. 338–351. Available at http://dx.doi.org/10.1007/978-3-540-24597-1_29.
  11. Ariel Rubinstein (1982): Perfect equilibrium in a bargaining model. Econometrica 50(1), pp. 97–109, doi:10.2307/1912531.
  12. Igor Walukiewicz (2001): Pushdown Processes: Games and Model-Checking. Inf. Comput. 164(2), pp. 234–263. Available at http://dx.doi.org/10.1006/inco.2000.2894.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org