Toward a switching theory of CMOS circuits
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Progress measures and stack assertions for fair termination
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Quantitative solution of omega-regular games380872
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Alternating-time temporal logic
Journal of the ACM (JACM)
Relaxed update and partition network games
Fundamenta Informaticae
Journal of Logic, Language and Information
Two-Way Alternating Automata and Finite Models
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Game-Theoretic Models of Networks
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
The Control of Synchronous Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
The Control of Synchronous Systems, Part II
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Optimal Bounds for Transformations of omega-Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
State Space Reductions for Alternating Büchi Automata
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Complexity of Some Infinite Games Played on Finite Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
The finite graph problem for two-way alternating automata
Theoretical Computer Science - Foundations of software science and computation structures
Convertibility verification and converter synthesis: two faces of the same coin
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Automata logics, and infinite games
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
Simulation relations for alternating Büchi automata
Theoretical Computer Science
Games in system design and verification
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Bridging the gap between fair simulation and trace inclusion
Information and Computation
Ranking Automata and Games for Prioritized Requirements
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Facets of Synthesis: Revisiting Church's Problem
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Tighter Bounds for the Determinisation of Büchi Automata
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Qualitative Concurrent Stochastic Games with Imperfect Information
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Finitary winning in ω-regular games
ACM Transactions on Computational Logic (TOCL)
Bridging the gap between fair simulation and trace inclusion
Information and Computation
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Information flow in concurrent games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Optimal strategy synthesis in stochastic Müller games
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Admissibility in infinite games
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Memory reduction for strategies in infinite games
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Stochastic Müller games are PSPACE-complete
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Finite state strategies in one player McNaughton games
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Church's problem and a tour through automata theory
Pillars of computer science
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Multipebble simulations for alternating automata
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Faster algorithms for mean-payoff games
Formal Methods in System Design
Qualitative concurrent parity games
ACM Transactions on Computational Logic (TOCL)
Yuri, logic, and computer science
Fields of logic and computation
On Monadic theories of monadic predicates
Fields of logic and computation
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Minimum attention controller synthesis for omega-regular objectives
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Theoretical Computer Science
The complexity of stochastic rabin and streett games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Regular sets over extended tree structures
Theoretical Computer Science
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
The complexity of stochastic Müller games
Information and Computation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Minimizing generalized büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Gist: a solver for probabilistic games
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Synthesis for probabilistic environments
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Simulation relations for alternating parity automata and parity games
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Finitary winning in ω-regular games
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Groups, graphs, languages, automata, games and second-order monadic logic
European Journal of Combinatorics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Strategy machines and their complexity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Relaxed Update and Partition Network Games
Fundamenta Informaticae
Parity games on undirected graphs
Information Processing Letters
Fundamenta Informaticae
Theoretical Computer Science
Logical refinements of Church's problem
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Code aware resource management
Formal Methods in System Design
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.00 |
In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems you did most probably use Rabin's result. But did you make your way through Rabin's cumbersome proof with its induction on countable ordinals? Building on ideas of our predecessors-&-mdash;and especially those of B-&-uuml;chi-&-mdash;we give here an alternative and transparent proof of Rabin's result. Generalizations and further results will be published elsewhere.