10715 search results - page 369 / 2143 » Proofs from Tests |
172
click to vote
FORMATS
2003
Springer
16 years 2 days ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
200
click to vote
CSR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
204
click to vote
ECOOPW
1999
Springer
15 years 11 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
171
click to vote
EKAW
1994
Springer
15 years 11 months ago
1994
Springer
Formal knowledge modelling languages have a number of advantages over informal languages, such as their precise meaning and the possibility to derive propertiesthrough formal proof...
176
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we show the optimality of a certain class of disturbance-affine control policies in the context of one-dimensional, constrained, multi-stage robust optimization. Ou...