2005 · 38 citations · 4 references
EngineeringComputer ScienceMathematicsProbability TheoryStochastic ProcessesSystems ModelingAutomata TheoryFinite AutomataFinite-state MachinesMarkov ChainsMarkov ProcessesModel TheoryBisimulationBisimulation AnalysisProbabilistic AutomataProbabilistic Finite AutomataProbabilistic Finite State MachinesStrong BisimulationTransition SystemsWeak Bisimulation
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, and Sokolsky, and the probabilistic automata of Segala. We identify a taxonomy of bisimulation relations that captures the existing definitions for each one of the three models, and we compare the relations within each model and across models. The comparison across models is given according to a notion of embedding, where we order the three models by generality and we view objects in less general models as objects of more general models.
4
Automatic verification of probabilistic concurrent finite state programs
Moshe Y. Vardi · 1985 · 675 citations
Michael O. Rabin · Information and Control · 1963 · 627 citations
Reactive, generative, and stratified models of probabilistic processes
Rob van Glabbeek, Scott A. Smolka, Bernhard Steffen et al. · 2002 · 164 citations · Full text