512 search results - page 60 / 103 » Automata as Abstractions |
WOLLIC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
COLT
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas,...
FSTTCS
1994
Springer
14 years 24 days ago
1994
Springer
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 ...
FM
2006
Springer
14 years 11 days ago
2006
Springer
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...
BIRTHDAY
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper presents a formal framework, experimental infrastructure, and computational environment for modeling, analyzing and regulating the behavior of cardiac tissues....