We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper is twofold: On the one hand it provides an overview of existing types of probabilistic systems and, on the other hand, it explains the relationship between these models.
|
2778
|
Communication sequential processes
– Hoare
- 1985
|
|
484
|
Finite Markov Chains
– Kemeny, Snell
- 1960
|
|
427
|
A Compositional Approach to Performance Modelling
– Hillston
- 1996
|
|
324
|
Bisimulation through probabilistic testing
– Larsen, Skou
- 1991
|
|
243
|
Categories for the Working Mathematician
– MacLane
- 1971
|
|
196
|
A tutorial on (co)algebras and (co)induction
– Jacobs, Rutten
- 1997
|
|
186
|
Algebra of communicating processes with abstraction
– Bergstra, Klop
- 1985
|
|
183
|
Probabilistic simulations for probabilistic processes
– Segala, Lynch
- 1995
|
|
173
|
Automatic verification of probabilistic concurrent finite-state programs
– Vardi
- 1985
|
|
151
|
Modeling and verification of randomized distributed real-time systems
– Segala
- 1995
|
|
141
|
Model checking of probabilistic and nondeterministic systems
– Bianco, Alfaro
- 1995
|
|
137
|
Time and Probability in Formal Design of Distributed Systems
– Hansson
- 1994
|
|
128
|
Reactive, generative, and stratified models of probabilistic processes
– Glabbeek, Steffen
- 1995
|
|
111
|
The complexity of probabilistic verification
– Courcoubetis, Yannakakis
- 1995
|
|
108
|
Dynamic Probabilistic Systems
– Howard
- 1971
|
|
107
|
Probabilistic automata
– Rabin
- 1963
|
|
91
|
Finite State Markovian Decision Processes
– Derman
- 1970
|
|
86
|
Algebraic reasoning for probabilistic concurrent systems
– Giacalone, Jou, et al.
- 1990
|
|
82
|
Stochastic Automata Network for modeling parallel systems
– Plateau, Atif
- 1991
|
|
72
|
A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
– Bernardo, Gorrieri
- 1998
|
|
71
|
Formal Verification of Probabilistic Systems
– Alfaro
- 1997
|
|
63
|
Axiomatizing probabilistic processes: ACP with generative probabilities
– Baeten, Bergstra, et al.
|
|
63
|
Model checking continuous-time Markov chains by transient analysis
– Baier, Haverkort, et al.
- 2000
|
|
63
|
Interactive Markov Chains
– Hermanns
- 1999
|
|
60
|
Specification and refinement of probabilistic processes
– Jonsson, Larsen
- 1991
|
|
60
|
Equivalences, Congruences and Complete Axiomatizations for
– Jou, Smolka
- 1990
|
|
60
|
Bisimulation for probabilistic transition systems: a coalgebraic approach (extended abstract
– Rutten
- 1997
|
|
47
|
Testing preorders for probabilistic processes
– Cleaveland, Smolka, et al.
- 1992
|
|
47
|
Verification of multiprocess probabilistic protocols
– Pnueli, Zuck
- 1986
|
|
44
|
Probabilistic extensions of process algebras
– Jonsson, Yi, et al.
- 2001
|
|
44
|
Composition and behaviors of probabilistic i/o automata
– Wu, Smolka, et al.
- 1994
|
|
42
|
Markovian process algebra: composition and equivalence
– Buchholz
- 1994
|
|
40
|
Compositional testing preorders for probabilistic processes
– Jonsson, Yi
- 1995
|
|
37
|
On algorithmic verification methods for probabilistic systems. Habilitation thesis, submitted
– Baier
- 1998
|
|
36
|
Testing equivalences and fully abstract models for probabilistic processes
– Christoff
- 1990
|
|
33
|
Compositional verification of probabilistic processes
– Larsen, Skou
- 1992
|
|
32
|
Algebras and automata for timed and stochastic systems
– D’Argenio
- 1999
|
|
31
|
Theory and Application of Extended Markovian Process Algebra
– Bernardo
- 1999
|
|
31
|
Katoen: On Generative Parallel Composition
– d'Argenio, Hermanns, et al.
- 1999
|
|
31
|
K.G.: Reachability analysis of probabilistic systems by successive refinements
– D’Argenio, Jeannet, et al.
- 2001
|
|
29
|
B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6
– Hansson, Jonsson
- 1994
|
|
28
|
Axiomatizations for probabilistic bisimulation
– Bandini, Segala
- 2001
|
|
27
|
A hierarchy of probabilistic system types
– Bartels, Sokolova, et al.
- 2003
|
|
27
|
Universal coalgebra: A theory of systems, Theoret
– Rutten
|
|
25
|
Process algebra with probabilistic choice
– Andova
- 1999
|
|
24
|
A logical characterization of bisimulation for labelled Markov processes
– Desharnais, Edalat, et al.
- 1998
|
|
22
|
Coalgebraic logic. Annals of Pure and Applied Logic
– Moss
- 1999
|
|
20
|
Probabilistic and Prioritized Models of Timed CSP
– Lowe
- 1995
|
|
18
|
Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation
– Baier
- 1996
|
|
16
|
A testing equivalence for reactive probabilistic processes
– Kwiatkowska, Norman
- 1998
|
