Luca de Alfaro, Rupak Majumdar, Vishwanath Raman & Marielle Stoelinga (2007):
Game Relations and Metrics.
In: LICS '07.
IEEE Computer Society,
pp. 99–108,
doi:10.1109/LICS.2007.22.
Christel Baier (1996):
Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation.
In: CAV'96,
LNCS 1102,
pp. 38–49,
doi:10.1007/3-540-61474-5_57.
Franck van Breugel, Babita Sharma & James Worrell (2007):
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems..
In: FOSSACS,
LNCS 4423.
Springer,
pp. 123–137,
doi:10.1007/978-3-540-71389-0_10.
Franck van Breugel & James Worrell (2001):
An Algorithm for Quantitative Verification of Probabilistic Transition Systems.
In: CONCUR '01.
Springer-Verlag,
pp. 336–350,
doi:10.1007/3-540-44685-0_23.
Franck van Breugel & James Worrell (2004):
A behavioural pseudometric for probabilistic transition systems.
Theor. Comput. Sci. 331(1),
pp. 115–142,
doi:10.1007/3-540-48224-5_35.
Stefano Cattani & Roberto Segala (2002):
Decision Algorithms for Probabilistic Bisimulation.
In: CONCUR '02.
Springer-Verlag,
pp. 371–385,
doi:10.1007/3-540-45694-5_25.
Stefano Cattani, Roberto Segala, Marta Kwiatkowska & Gethin Norman (2005):
Stochastic transition systems for continuous state spaces and non-determinism.
In: FOSSACS'05,
LNCS 3441.
Springer Verlag,
pp. 125–139,
doi:10.1007/978-3-540-31982-5_8.
K. Chatterjee, Luca de Alfaro, Rupak Majumdar & Vishwanath Raman (2010, to appear.):
Algorithms for game metrics.
LMCS: Logical Methods in Computer Science,
doi:10.2168/LMCS-6(3:13)2010.
Pedro R. D'Argenio, Nicolás Wolovick, Pedro Sánchez Terraf & Pablo Celayes (2009):
Nondeterministic labeled Markov processes: bisimulations and logical characterization.
QEST'09,
pp. 11–20,
doi:10.1109/QEST.2009.17.
Josée Desharnais, Abbas Edalat & Prakash Panangaden (2002):
Bisimulation for Labeled Markov Processes.
Information and Computation 179(2),
pp. 163–193,
doi:10.1.1.16.5653.
Josée Desharnais, Vineet Gupta, R. Jagadeesan & P. Panangaden (1999):
Metrics for Labeled Markov Processes.
In: CONCUR'99,
LNCS.
Springer-Verlag,
pp. 258–273,
doi:10.1007/3-540-48320-9_19.
Josée Desharnais, François Laviolette & Mathieu Tracol (2008):
Approximate analysis of probabilistic processes: logic, simulation and games.
In: QEST'08.
IEEE Computer Society,
pp. 264–273,
doi:10.1109/QEST.2008.42.
Josée Desharnais, François Laviolette & Sami Zhioua (2006):
Testing Probabilistic Equivalence Through Reinforcement Learning.
In: FSTTCS'06,
LNCS 4337.
Springer,
pp. 236–247,
doi:10.1007/11944836_23.
Norm Ferns, Prakash Panangaden & Doina Precup (2004):
Metrics for finite Markov decision processes.
In: UAI'04.
AUAI Press Arlington, Virginia, United States,
pp. 162–169,
doi:10.1.1.87.9485.
Norman Ferns, Prakash Panangaden & Doina Precup (2005):
Metrics for Markov Decision Processes with Infinite State Spaces.
In: UAI'05.
AUAI Press,
pp. 201,
doi:10.1007/BF01908587.
Michael R. Garey & David S. Johnson (1979):
Computers and Intractability: A Guide to the Theory of NP-completeness.
W. H. Freeman & Co.,
New York, NY, USA.
Alessandro Giacalone, Chi-Chang Jou & Scott A. Smolka (1990):
Algebraic Reasoning for Probabilistic Concurrent Systems.
In: Proc. IFIP TC2 Working Conference on Programming Concepts and Methods.
North-Holland,
pp. 443–458,
doi:10.1.1.56.3664.
Holger Hermanns (2002):
Interactive Markov chains, and the quest for quantified quality.
Springer-Verlag,
Berlin, Heidelberg,
doi:10.1007/3-540-45804-2.
Kim G. Larsen & Arne Skou (1991):
Bisimulation through Probablistic Testing.
Information and Computation 94,
pp. 1–28,
doi:10.1.1.158.9316.
Augusto Parma & Roberto Segala (2007):
Logical characterisation of Bisimulations for Discrete Probabilistic Systems.
In: FOSSACS'07,
LNCS 4423.
Springer-Verlag,
pp. 287–301,
doi:10.1007/978-3-540-71389-0_21.
Martin L. Puterman (1994):
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
Wiley.
Roberto Segala & Nancy Lynch (1994):
Probabilistic Simulations for Probabilistic Processes.
In: CONCUR'94,
LNCS 836.
Springer-Verlag,
pp. 481–496,
doi:10.1007/BFb0015027.
Roberto Segala & Andrea Turrini (2007):
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata.
In: CSF'07,
pp. 140–156,
doi:10.1007/3-540-45694-5_25.
Lijun Zhang, Holger Hermanns, Friedrich. Eisenbrand & David N. Jansen (2007):
Flow faster: efficient decision algorithms for probabilistic simulations.
In: TACAS'07,
LNCS 4424.
Springer-Verlag,
pp. 155–169,
doi:10.1007/978-3-540-71209-1_14.