Sciweavers

100 search results - page 3 / 20
» Symbolic Bisimulations for Probabilistic Systems
Sort
View
QEST
2007
IEEE
13 years 11 months ago
Qualitative Logics and Equivalences for Probabilistic Systems
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
Luca de Alfaro, Krishnendu Chatterjee, Marco Faell...
FORTE
2001
13 years 6 months ago
A Symbolic Semantics and Bisimulation for Full LOTOS
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to da...
Muffy Calder, Carron Shankland
CSFW
2003
IEEE
13 years 10 months ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
QEST
2009
IEEE
14 years 1 days ago
Nondeterministic Labeled Markov Processes: Bisimulations and Logical Characterization
We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondetermi...
Pedro R. D'Argenio, Nicolás Wolovick, Pedro...
SCL
2010
98views more  SCL 2010»
13 years 3 months ago
Symbolic models for nonlinear time-delay systems using approximate bisimulations
In this paper we show that incrementally stable nonlinear time–delay systems admit symbolic models which are approximately equivalent, in the sense of approximate bisimulation, ...
Giordano Pola, Pierdomenico Pepe, Maria Domenica D...