Alternating tree automata

In automata theory, an alternating tree automaton is an extension of nondeterministic tree automaton as same as alternating finite automaton extends…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

We introduce an automata-theoretic approach for the verification of multi-agent systems. We present a translation between…

2009

The game tree languages can be viewed as an automata-theoretic counterpart of parity games on graphs. They witness the strictness…

2009

Recently Murlak and one of the authors have shown that the family of trees recognized by weak alternating automata (or…

2008

1 Fa ulty of Mathemati s, Informati s, and Me hani s Warsaw University, Poland E-mail address: {shummel,henrykm,niwinski} mimuw…

2006

While alternating or non-deterministic tree automata are syntax (e.g., clause sets), complete deterministic automata are best…

2006

This paper addresses the problem of synthesizing an asynchronous system from a temporal specification. We show that the cost of…

2003

We show how alternating automata provide decision procedures for the equality of inductively de3ned Boolean functions and present…

2001

This paper describes an approach to engineering efficient model checkers that are generic with respect to the temporal logic in…

2000

1989

This theory has been extended to infinite trees ([II], [16], [17], [19], [22], [23], [25], [26], [27], [34]). In [23], M. O…