Control of omega-Automata, Church's Problem, and the Emptiness Problem for Tree omega-Automata

Church's problem and the emptiness problem for Rabin automata on infinite trees, which represent basic paradigms for program synthesis and logical decision procedures, are formulated as a control problem for automata on infinite strings. The alphabet of an automaton is interpreted not as a set of input symbols giving rise to state transitions but rather as a set of output symbols generated during spontaneous state transitions; in addition, it is assumed that automata can be “controlled” through the imposition of certain allowable restrictions on the set of symbols that may be generated at a given instant. The problems in question are then recast as that of deciding membership in a deterministic Rabin automaton's controllability subset — the set of states from which the automaton can be controlled to the satisfaction of its own acceptance condition. The new formulation leads to a direct, efficient and natural solution based on a fixpoint representation of the controllability subset. This approach combines advantages of earlier solutions and admits useful extensions incorporating liveness assumptions.

[1]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[3]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[4]  Robert S. Streett.  Propositional Dynamic Logic of looping and converse , 1981, STOC '81.

[5]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[6]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[7]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[8]  Charles Rackoff,et al.  The Emptiness Problem for Automata on Infinite Trees , 1972, SWAT.

[9]  Lawrence H. Landweber.  Synthesis algorithms for sequential machines , 1968, IFIP Congress.

[10]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[11]  J. G. Thistle.  Control of infinite behaviour of discrete-event systems , 1992 .

[12]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[14]  Boris A. Trakhtenbrot,et al.  Finite automata : behavior and synthesis , 1973 .

[15]  E. Allen Emerson,et al.  Automata, Tableaux and Temporal Logics (Extended Abstract) , 1985, Logic of Programs.

[16]  Pierre Wolper,et al.  Reasoning about fair concurrent programs , 1986, STOC '86.

[17]  Martín Abadi,et al.  Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.

[18]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[19]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[20]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[21]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[22]  P. H. Lindsay.  Human Information Processing , 1977 .

[23]  M. Rabin.  Automata on Infinite Objects and Church's Problem , 1972 .

[24]  M. Rabin.  Weakly Definable Relations and Special Automata , 1970 .

[25]  Patrick Suppes,et al.  Logic, Methodology and Philosophy of Science , 1963 .

[26]  Jan van Leeuwen,et al.  Formal models and semantics , 1990 .