DMCA
On Polynomial-Size Programs Winning Finite-State Games (1995)
| Citations: | 6 - 0 self |
BibTeX
@MISC{Lescow95onpolynomial-size,
author = {Helmut Lescow},
title = {On Polynomial-Size Programs Winning Finite-State Games},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. Finite-state reactive programs are identified with finite automata which realize winning strategies in Buchi-Landweber games. The games are specified by finite "game graphs" equipped with different winning conditions ("Rabin condition", "Streett condition" and "Muller condition ", defined in analogy to the theory of !-automata). We show that for two classes of games with Muller winning condition polynomials are both an upper and a lower bound for the size of winning reactive programs. Also we give a new proof for the existence of no-memory strategies in games with Rabin winning condition, as well as an exponential lower bound for games with Streett winning condition. 1 Introduction In the construction of correct programs there are two complementary approaches: the verification of an existing program relative to a given specification (for example, by a model-checking algorithm), or the algorithmic synthesis of a correct program from the specification. The present paper deals with the...
Keyphrases
polynomial-size program winning finite-state game correct program algorithmic synthesis model-checking algorithm rabin condition condition polynomial muller condition reactive program no-memory strategy finite-state reactive program buchi-landweber game new proof finite automaton complementary approach present paper deal program relative streett condition finite game graph
