Sciweavers

3 search results - page 1 / 1
» Synthesis of Finite-state and Definable Winning Strategies
Sort
View
FSTTCS
1994
Springer
13 years 9 months ago
Finite-State Strategies in Regular Infinite Games
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
Wolfgang Thomas
FSTTCS
2009
Springer
13 years 8 months ago
Synthesis of Finite-state and Definable Winning Strategies
ABSTRACT. Church's Problem asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence I an output sequen...
Alexander Rabinovich
DFT
1998
IEEE
78views VLSI» more  DFT 1998»
13 years 9 months ago
A System for Evaluating On-Line Testability at the RT-level
This paper presents a system to evaluate the testability of an on-line testable circuit. The system operates at the RT-level, before the logic synthesis step, and allows for an ex...
Silvia Chiusano, Fulvio Corno, Matteo Sonza Reorda...