S. Abramsky (1987):
Observational Equivalence as a Testing Equivalence.
Theoretical Computer Science 53,
pp. 225–241,
doi:10.1016/0304-3975(87)90065-X.
C. Baier, J.-P. Katoen, H. Hermanns & V. Wolf (2005):
Comparative Branching-Time Semantics for Markov Chains.
Information and Computation 200,
pp. 149–214,
doi:10.1016/j.ic.2005.03.001.
M. Bernardo, R. De Nicola & M. Loreti (2012):
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes.
In: Proc. of FOSSACS 2012,
LNCS 7213.
Springer,
pp. 195–209,
doi:10.1007/978-3-642-28729-9_13.
M. Bernardo, R. De Nicola & M. Loreti (2013):
A Uniform Framework for Modeling Nondeterministic, Probabilistic, Stochastic, or Mixed Processes and their Behavioral Equivalences.
Information and Computation 225,
pp. 29–82,
doi:10.1016/j.ic.2013.02.004.
M. Bernardo, R. De Nicola & M. Loreti (2013):
Revisiting Bisimilarity and its Modal Logic for Nondeterministic and Probabilistic Processes.
Technical Report.
Available at http://eprints.imtlucca.it/1553/.
S.D. Brookes, C.A.R. Hoare & A.W. Roscoe (1984):
A Theory of Communicating Sequential Processes.
Journal of the ACM 31,
pp. 560–599,
doi:10.1145/828.833.
R. Cleaveland, Z. Dayar, S.A. Smolka & S. Yuen (1999):
Testing Preorders for Probabilistic Processes.
Information and Computation 154,
pp. 93–148,
doi:10.1006/inco.1999.2808.
L. de Alfaro, R. Majumdar, V. Raman & M. Stoelinga (2008):
Game Refinement Relations and Metrics.
Logical Methods in Computer Science 4(3:7),
pp. 1–28,
doi:10.2168/LMCS-4(3:7)2008.
R. De Nicola (1987):
Extensional Equivalences for Transition Systems.
Acta Informatica 24,
pp. 211–237,
doi:10.1007/BF00264365.
R. De Nicola & M. Hennessy (1984):
Testing Equivalences for Processes.
Theoretical Computer Science 34,
pp. 83–133,
doi:10.1016/0304-3975(84)90113-0.
Y. Deng, R.J. van Glabbeek, M. Hennessy & C. Morgan (2008):
Characterising Testing Preorders for Finite Probabilistic Processes.
Logical Methods in Computer Science 4(4:4),
pp. 1–33,
doi:10.2168/LMCS-4(4:4)2008.
S. Georgievska & S. Andova (2010):
Retaining the Probabilities in Probabilistic Testing Theory.
In: Proc. of FOSSACS 2010,
LNCS 6014.
Springer,
pp. 79–93,
doi:10.1007/978-3-642-12032-9_7.
A. Giacalone, C.-C. Jou & S.A. Smolka (1990):
Algebraic Reasoning for Probabilistic Concurrent Systems.
In: Proc. of PROCOMET 1990.
North-Holland,
pp. 443–458,
doi:10.1.1.56.3664.
R.J. van Glabbeek (2001):
The Linear Time – Branching Time Spectrum I.
In: Handbook of Process Algebra.
Elsevier,
pp. 3–99,
doi:10.1016/B978-044482830-9/50019-9.
H. Hansson & B. Jonsson (1990):
A Calculus for Communicating Systems with Time and Probabilities.
In: Proc. of RTSS 1990.
IEEE-CS Press,
pp. 278–287,
doi:10.1109/REAL.1990.128759.
M. Hennessy & R. Milner (1985):
Algebraic Laws for Nondeterminism and Concurrency.
Journal of the ACM 32,
pp. 137–162,
doi:10.1145/2455.2460.
D.T. Huynh & L. Tian (1992):
On Some Equivalence Relations for Probabilistic Processes.
Fundamenta Informaticae 17,
pp. 211–234.
H. Jifeng, K. Seidel & A. McIver (1997):
Probabilistic Models for the Guarded Command Language.
Science of Computer Programming 28,
pp. 171–192,
doi:10.1016/S0167-6423(96)00019-6.
B. Jonsson & W. Yi (1995):
Compositional Testing Preorders for Probabilistic Processes.
In: Proc. of LICS 1995.
IEEE-CS Press,
pp. 431–441.
C.-C. Jou & S.A. Smolka (1990):
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes.
In: Proc. of CONCUR 1990,
LNCS 458.
Springer,
pp. 367–383,
doi:10.1007/BFb0039071.
K.G. Larsen & A. Skou (1991):
Bisimulation Through Probabilistic Testing.
Information and Computation 94,
pp. 1–28,
doi:10.1016/0890-5401(91)90030-6.
N. Lopez & M. Nuñez (2004):
An Overview of Probabilistic Process Algebras and Their Equivalences.
In: Validation of Stochastic Systems,
LNCS 2925.
Springer,
pp. 89–123,
doi:10.1007/978-3-540-24611-4_3.
E.-R. Olderog & C.A.R. Hoare (1986):
Specification-Oriented Semantics for Communicating Processes.
Acta Informatica 23,
pp. 9–66,
doi:10.1007/BF00268075.
A. Philippou, I. Lee & O. Sokolsky (2000):
Weak Bisimulation for Probabilistic Systems.
In: Proc. of CONCUR 2000,
LNCS 1877.
Springer,
pp. 334–349,
doi:10.1007/3-540-44618-4_25.
R. Segala (1995):
Modeling and Verification of Randomized Distributed Real-Time Systems.
PhD Thesis.
R. Segala (1995):
A Compositional Trace-Based Semantics for Probabilistic Automata.
In: Proc. of CONCUR 1995,
LNCS 962.
Springer,
pp. 234–248,
doi:10.1007/3-540-60218-6_17.
R. Segala (1996):
Testing Probabilistic Automata.
In: Proc. of the 7th Int. Conf. on Concurrency Theory (CONCUR 1996),
LNCS 1119.
Springer,
pp. 299–314,
doi:10.1007/3-540-61604-7_62.
R. Segala & N.A. Lynch (1994):
Probabilistic Simulations for Probabilistic Processes.
In: Proc. of CONCUR 1994,
LNCS 836.
Springer,
pp. 481–496,
doi:10.1007/BFb0015027.
R. Segala & A. Turrini (2005):
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models.
In: Proc. of QEST 2005.
IEEE-CS Press,
pp. 44–53,
doi:10.1109/QEST.2005.9.
A. Sokolova & E.P. de Vink (2004):
Probabilistic Automata: System Types, Parallel Composition and Comparison.
In: Validation of Stochastic Systems,
LNCS 2925.
Springer,
pp. 1–43,
doi:10.1007/978-3-540-24611-4_1.
L. Song, L. Zhang & J.C. Godskesen (2011):
Bisimulations Meet PCTL Equivalences for Probabilistic Automata.
In: Proc. of CONCUR 2011,
LNCS 6901.
Springer,
pp. 108–123,
doi:10.1007/978-3-642-23217-6_8.
M. Tracol, J. Desharnais & A. Zhioua (2011):
Computing Distances Between Probabilistic Automata.
In: Proc. of QAPL 2011,
EPTCS 57,
pp. 148–162,
doi:10.4204/EPTCS.57.11.
M.Y. Vardi (1985):
Automatic Verification of Probabilistic Concurrent Finite-State Programs.
In: Proc. of FOCS 1985.
IEEE-CS Press,
pp. 327–338,
doi:10.1109/SFCS.1985.12.
V. Wolf (2005):
Testing Theory for Probabilistic Systems.
In: Model-Based Testing of Reactive Systems,
LNCS 3472.
Springer,
pp. 233–275,
doi:10.1007/11498490_11.
W. Yi & K.G. Larsen (1992):
Testing Probabilistic and Nondeterministic Processes.
In: Proc. of PSTV 1992.
North-Holland,
pp. 47–61.
eptcs@eptcs.org