Sciweavers

41 search results - page 2 / 9
» Bisimulation and cocongruence for probabilistic systems
Sort
View
CSFW
2003
IEEE
13 years 11 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 9 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...
ENTCS
2008
115views more  ENTCS 2008»
13 years 5 months ago
Branching Bisimulation Congruence for Probabilistic Systems
The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define ano...
Nikola Trcka, Sonja Georgievska
QEST
2005
IEEE
13 years 11 months ago
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models
We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee...
Roberto Segala, Andrea Turrini
CONCUR
2000
Springer
13 years 10 months ago
Weak Bisimulation for Probabilistic Systems
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
Anna Philippou, Insup Lee, Oleg Sokolsky