Sciweavers

349 search results - page 35 / 70
» The Finite and the Infinite
Sort
View
CSL
2008
Springer
13 years 11 months ago
Quantitative Languages
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
AAAI
1990
13 years 11 months ago
Operationality Criteria for Recursive Predicates
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
Stanley Letovsky
AUTOMATICA
2008
60views more  AUTOMATICA 2008»
13 years 10 months ago
Control of nonstationary LPV systems
This paper considers control of nonstationary linear parameter-varying systems, and is motivated by interest in the control of nonlinear systems along prespecified trajectories. I...
Mazen Farhood, Geir E. Dullerud
TCS
2008
13 years 9 months ago
Simple permutations: Decidability and unavoidable substructures
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
Robert Brignall, Nikola Ruskuc, Vincent Vatter
ATVA
2006
Springer
140views Hardware» more  ATVA 2006»
14 years 1 months ago
On the Construction of Fine Automata for Safety Properties
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
Orna Kupferman, Robby Lampert