T. Brázdil, A. Kučera & O. Stražovský (2004):
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems.
In: P. Gardner & N. Yoshida: CONCUR 2004,
Lecture Notes in Computer Science 3170.
Springer Berlin Heidelberg,
pp. 193–208,
doi:10.1007/978-3-540-28644-8_13.
S. Cattani & R. Segala (2002):
Decision Algorithms for Probabilistic Bisimulation.
In: CONCUR 2002,
Lecture Notes in Computer Science 2421.
Springer,
pp. 371–385,
doi:10.1007/3-540-45694-5_25.
J. Desharnais, V. Gupta, R. Jagadeesan & P. Panangaden (2010):
Weak bisimulation is sound and complete for PCTL^\voidb@x *.
Inf. Comput. 208(2),
pp. 203–219,
doi:10.1016/j.ic.2009.11.002.
C. Eisentraut, H. Hermanns, J. Schuster, A. Turrini & L. Zhang (2013):
The Quest for Minimal Quotients for Probabilistic Automata.
In: TACAS 2013,
Lecture Notes in Computer Science 7795.
Springer,
pp. 16–31,
doi:10.1007/978-3-642-36742-7_2.
V. Forejt, P. Jancar, S. Kiefer & J. Worrell (2012):
Bisimilarity of Probabilistic Pushdown Automata.
In: FSTTCS 2012,
Leibniz International Proceedings in Informatics (LIPIcs) 18.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Germany,
pp. 448–460,
doi:10.4230/LIPIcs.FSTTCS.2012.448.
Available at http://drops.dagstuhl.de/opus/volltexte/2012/3880.
H. Hermanns & A. Turrini (2012):
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time.
In: FSTTCS 2012,
Leibniz International Proceedings in Informatics (LIPIcs) 18.
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik,
Dagstuhl, Germany,
pp. 435–447,
doi:10.4230/LIPIcs.FSTTCS.2012.435.
Available at http://drops.dagstuhl.de/opus/volltexte/2012/3879/.
M. Krein & D. Milman (1940):
On extreme points of regular convex sets.
Studia Mathematica 9(1),
pp. 133–138.
Available at http://eudml.org/doc/219061.
N. Lynch, R. Segala & F. Vaandrager (2003):
Compositionality for probabilistic automata.
In: CONCUR 2003.
Springer,
pp. 208–221,
doi:10.1007/978-3-540-45187-7_14.
N. A. Lynch, R. Segala & F. W. Vaandrager (2007):
Observing Branching Structure through Probabilistic Contexts.
SIAM J. Comput. 37(4),
pp. 977–1013,
doi:10.1147/S0097539704446487.
A. Parma & R. Segala (2007):
Logical characterizations of bisimulations for discrete probabilistic systems.
In: Foundations of Software Science and Computational Structures.
Springer,
pp. 287–301,
doi:10.1007/978-3-540-71389-0_21.
R. Segala (1995):
Modeling and Verification of Randomized Distributed Real-Time Systems.
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology.
Available at http://profs.sci.univr.it/~segala/www/phd.html.
R. Segala & N. A. Lynch (1995):
Probabilistic Simulations for Probabilistic Processes.
Nord. J. Comput. 2(2),
pp. 250–273,
doi:10.1007/BFb0015027.
eptcs@eptcs.org