Small witnesses, accepting lassos and winning strategies in omega-automata and games

Obtaining accepting lassos, witnesses and winning strategies in omega-automata and games with omega-regular winning conditions is an integral part of many formal methods commonly found in practice today. Despite the fact that in most applications, the lassos, witnesses and strategies found should be as small as possible, little is known about the hardness of obtaining small such certificates. In this paper, we survey the known hardness results and complete the complexity landscape for the cases not considered in the literature so far. We pay particular attention to the approximation hardness of the problems as approximate small solutions usually suffice in practice.

[1]  Orna Kupferman,et al.  Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words , 2006, CONCUR.

[2]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[3]  Colin Stirling,et al.  Bisimulation, Modal Logic and Model Checking Games , 1999, Logic Journal of the IGPL.

[4]  Christof Löding,et al.  Memory Reduction for Strategies in Infinite Games , 2007, CIAA.

[5]  Denis Poitrenaud,et al.  On-the-fly Emptiness Check of Transition-Based Streett Automata , 2009, ATVA.

[6]  Edmund M. Clarke,et al.  Efficient generation of counterexamples and witnesses in symbolic model checking , 1995, DAC '95.

[7]  Jan Arne Telle,et al.  Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning , 1995, SWAT.

[8]  Javier Esparza,et al.  A Note on On-the-Fly Verification Algorithms , 2005, TACAS.

[9]  Igor Walukiewicz,et al.  How much memory is needed to win infinite games? , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[10]  Wolfgang J. Paul,et al.  Computer architecture - complexity and correctness , 2000 .

[11]  Orna Kupferman,et al.  Church's Problem Revisited , 1999, Bulletin of Symbolic Logic.

[12]  Venkatesan Guruswami,et al.  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..

[13]  Mihalis Yannakakis,et al.  Temporal Synthesis for Bounded Systems and Environments , 2011, STACS.

[14]  Florian Horn,et al.  Explicit Muller Games are PTIME , 2008, FSTTCS.

[15]  Alan J. Hu,et al.  Boosting Verification by Automatic Tuning of Decision Procedures , 2007, Formal Methods in Computer Aided Design (FMCAD'07).

[16]  Timo Latvala,et al.  Coping With Strong Fairness , 2000, Fundam. Informaticae.

[17]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[18]  E BryantRandal.  Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

[19]  Sven Schewe.  Solving Parity Games in Big Steps , 2007, FSTTCS.

[20]  Krishnendu Chatterjee,et al.  The Complexity of Coverage , 2008, APLAS.

[21]  Rüdiger Ehlers,et al.  Short Witnesses and Accepting Lassos in omega-Automata , 2010, LATA.

[22]  Paul Gastin,et al.  Minimal Counterexample Generation for SPIN , 2007, SPIN.

[23]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[24]  Faron Moller.  Logics for concurrency: structure versus automata , 1996, CSUR.

[25]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[26]  Amir Pnueli,et al.  Specify, Compile, Run: Hardware from PSL , 2007, COCV@ETAPS.