Sciweavers

115 search results - page 1 / 23
» Approximate bisimulation relations for constrained linear sy...
Sort
View
AUTOMATICA
2007
179views more  AUTOMATICA 2007»
13 years 5 months ago
Approximate bisimulation relations for constrained linear systems
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
Antoine Girard, George J. Pappas
BIRTHDAY
2003
Springer
13 years 10 months ago
Fair Equivalence Relations
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
13 years 9 months ago
A contractivity approach for probabilistic bisimulations of diffusion processes
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...
Alessandro Abate
ICALP
2004
Springer
13 years 10 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 5 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy