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...
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,...
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 ...
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...
Abstract. This paper presents a formal framework, experimental infrastructure, and computational environment for modeling, analyzing and regulating the behavior of cardiac tissues....
Ezio Bartocci, Flavio Corradini, Radu Grosu, Emanu...