EPTCS 25 - GANDALF 2010

• Hugo Gimbert, Wieslaw Zielonka:
  Blackwell-Optimal Strategies in Priority Mean-Payoff Games. 7-21
  
• Krishnendu Chatterjee, Rupak Majumdar:
  Discounting in Games across Time Scales. 22-29
  
• Julien Cristau, Claire David, Florian Horn:
  How do we remember the past in randomised strategies? 30-39
  
• Lubos Brim, Jakub Chaloupka:
  Using Strategy Improvement to Stay Alive. 40-54
  
• Giovanna D'Agostino, Giacomo Lenzi:
  On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components. 55-71
  
• Davide Bresolin, Pietro Sala, Guido Sciavicco:
  Begin, After, and Later: a Maximal Decidable Interval Temporal Logic. 72-88
  
• Andreas Morgenstern, Klaus Schneider:
  Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis. 89-102
  
• Catalin Dima, Constantin Enea, Dimitar P. Guelev:
  Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions. 103-117
  
• Oliver Friedmann, Martin Lange:
  Local Strategy Improvement for Parity Game Solving. 118-131
  
• Wladimir Fridman:
  Formats of Winning Strategies for Six Types of Pushdown Games. 132-145
  
• John Fearnley, Martin Zimmermann:
  Playing Muller Games in a Hurry. 146-161
  
• Soumya Paul, Ramaswamy Ramanujam:
  Imitation in Large Games. 162-172
  
• Christian Appold:
  Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking. 173-187
  
• Ivan Fialík:
  Unitary Noise and the Mermin-GHZ Game. 188-198
  
• Marco Bernardo:
  On the Expressiveness of Markovian Process Calculi with Durational and Durationless Actions. 199-213
  
• Davide Ancona, Giovanni Lagorio:
  Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas. 214-230
  

Last update Thu May 23 23:57:01 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page