S. Andova, S. Georgievska & N. Trcka (2012):
Branching bisimulation congruence for probabilistic systems.
Theoretical Computer Science 413,
pp. 58–72,
doi:10.1016/j.tcs.2011.07.020.
S. Andova & T.A.C. Willemse (2006):
Branching bisimulation for probabilistic systems: Characteristics and decidability.
Theoretical Computer Science 356,
pp. 325–355,
doi:10.1016/j.tcs.2006.02.010.
C. Baier, P.R. D'Argenio & H. Hermanns (2020):
On the probabilistic bisimulation spectrum with silent moves.
Acta Informatica 57,
pp. 465–512,
doi:10.1007/s00236-020-00379-2.
C. Baier, B. Engelen & M.E. Majster-Cederbaum (2000):
Deciding bisimilarity and similarity for probabilistic processes.
Journal of Computer Systems and Sciences 60(1),
pp. 187–231,
doi:10.1006/jcss.1999.1683.
C. Baier & M.Z. Kwiatkowska (2000):
Domain equations for probabilistic processes.
Mathematical Structures in Computer Science 10(6),
pp. 665–717,
doi:10.1017/S0960129599002984.
E. Bandini & R. Segala (2001):
Axiomatizations for Probabilistic Bisimulation.
In: F. Orejas et al.: Proc. ICALP 2001.
LNCS 2076,
pp. 370–381,
doi:10.1007/3-540-48224-5_31.
F. Breugel & J. Worrell (2005):
A behavioural pseudometric for probabilistic transition systems.
Theoretical Computer Science 331(1),
pp. 115–142,
doi:10.1016/j.tcs.2004.09.035.
S. Cattani & R. Segala (2002):
Decision Algorithms for Probabilistic Bisimulation.
In: L. Brim et al.: Proc. CONCUR 2002.
LNCS 2421,
pp. 371–385,
doi:10.1007/3-540-45694-5_25.
Y. Deng, R.J. van Glabbeek, M. Hennessy & C.C. Morgan (2009):
Testing Finitary Probabilistic Processes (extended abstract).
In: M. Bravetti & G. Zavattaro: Proc. CONCUR'09.
LNCS 5710,
pp. 274–288,
doi:10.1007/978-3-642-04081-8_19.
J. Desharnais, V. Gupta, R. Jagadeesan & P. Panangaden (1999):
Metrics for Labeled Markov Systems.
In: J.C.M. Baeten & S. Mauw: Proc. CONCUR '99.
LNCS 1664,
pp. 258–273,
doi:10.1007/3-540-48320-9_19.
C. Eisentraut, H. Hermanns, J. Krämer, A. Turrini & L. Zhang (2013):
Deciding Bisimilarities on Distributions.
In: K. Joshi et al.: Proc. QEST 2013.
LNCS 8054,
pp. 72–88,
doi:10.1007/978-3-642-40196-1_6.
L. Ferrer Fioriti, V. Hashemi, H. Hermanns & A. Turrini (2016):
Deciding probabilistic automata weak bisimulation: theory and practice.
Formal Aspects of Computing 28(1),
pp. 109–143,
doi:10.1007/s00165-016-0356-4.
A. Giacalone, Chi-Chang Jou & S.A. Smolka (1990):
Algebraic Reasoning for Probabilistic Concurrent Systems.
In: M. Broy & C.B. Jones: Programming concepts and methods.
North-Holland,
pp. 443–458.
M. Giry (1982):
A Categorical Approach to Probability Theory.
In: B. Banaschewski: Categorical Aspects of Topology and Analysis.
LNM 915,
pp. 68–85,
doi:10.1007/BFb0092872.
R.J. van Glabbeek, J.F. Groote & E.P. de Vink (2019):
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice.
Technical Report.
Eindhoven University of Technology.
Available at http://rvg.web.cse.unsw.edu.au/pub/AxiomProbBranchingBis.pdf.
R.J. van Glabbeek, J.F. Groote & E.P. de Vink (2019):
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice (extended abstract).
In: M.A. Alvim et al.: The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy.
LNCS 11760,
pp. 139–162,
doi:10.1007/978-3-030-31175-9_9.
J.F. Groote & F.W. Vaandrager (1990):
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence.
In: M. Paterson: Proc. ICALP '90.
LNCS 443,
pp. 626–638,
doi:10.1007/BFb0032063.
J.F. Groote, H.J. Rivera Verduzco & E.P. de Vink (2018):
An efficient algorithm to determine probabilistic bisimulation.
Algorithms 11(9),
pp. 131,1–22,
doi:10.3390/a11090131.
J.F. Groote & E.P. de Vink (2019):
An Axiomatization of Strong Distribution Bisimulation for a Language with a Parallel Operator and Probabilistic Choice.
In: M.H. ter Beek, A. Fantechi & L. Semini: From Software Engineering to Formal Methods and Tools, and Back.
LNCS 11865,
pp. 449–463,
doi:10.1007/978-3-030-30985-5_26.
H. Hansson & B. Jonsson (1990):
A Calculus for Communicating Systems with Time and Probabilities.
In: Proc. RTSS 1990.
IEEE,
pp. 278–287,
doi:10.1109/REAL.1990.128759.
J.I. den Hartog, E.P. de Vink & J.W. de Bakker (2000):
Metric semantics and full abstractness for action refinement and probabilistic choice.
Electronic Notes in Theoretical Computer Science 40,
pp. 72–99,
doi:10.1016/S1571-0661(05)80038-6.
M. Hennessy (2012):
Exploring probabilistic bisimulations, part I.
Formal Aspects of Computing 24,
pp. 749–768,
doi:10.1007/s00165-012-0242-7.
S. Lang (1997):
Undergraduate Analysis (2nd ed.).
Undergraduate Texts in Mathmatics.
Springer,
doi:10.1007/978-1-4757-2698-5.
M.D. Lee & E.P. de Vink (2016):
Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions.
In: P. Faliszewski, A. Muscholl & R. Niedermeier: Proc. MFCS 2016.
LIPIcs 58,
pp. 29:1–29:14,
doi:10.4230/LIPIcs.MFCS.2016.29.
G.J. Norman (1997):
Metric Semantics for Probabilistic Systems.
Universith of Birmingham.
R. Segala (1995):
Modeling and Verification of Randomized Distributed Real-Time Systems.
MIT.
Technical Report MIT/LCS/TR–676.
R. Segala & N.A. Lynch (1994):
Probabilistic simulations for probabilistic processes.
In: B. Jonsson & J. Parrow: Proc. CONCUR 94.
LNCS 836,
pp. 481–496,
doi:10.1007/978-3-540-48654-1_35.
M. Stoelinga (2002):
Alea Jacta est: Verification of probabilistic, real-time and parametric systems.
Radboud Universiteit.
A. Turrini & H. Hermanns (2015):
Polynomial time decision algorithms for probabilistic automata.
Information and Computation 244,
pp. 134–171,
doi:10.1016/j.ic.2015.07.004.
eptcs@eptcs.org