Sciweavers

513 search results - page 54 / 103
» Finitely Based, Finite Sets of Words
Sort
View
APAL
2008
104views more  APAL 2008»
14 years 12 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
14 years 12 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
SIAMJO
2008
93views more  SIAMJO 2008»
14 years 11 months ago
Stochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
Ralf Gollmer, Frederike Neise, Rüdiger Schult...
AUTOMATICA
2005
117views more  AUTOMATICA 2005»
14 years 11 months ago
Dwell-time controllers for stochastic systems with switching Markov chain
We study the problem of feedback stabilization of a family of nonlinear stochastic systems with switching mechanism modeled by a Markov chain. We introduce a novel notion of stabi...
Stefano Battilotti, A. De Santis
LPAR
2010
Springer
14 years 9 months ago
Coping with Selfish On-Going Behaviors
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...
Orna Kupferman, Tami Tamir