www.cs.ox.ac.uk/teaching/studentprojects/257.html

You are here:

• Home
• Current Students
• Algorithms for Bisimulation and Simulation on Markov Chains

Algorithms for Bisimulation and Simulation on Markov Chains

Supervisor	James Worrell
Suitable for	Mathematics and Computer Science, Part C Computer Science, Part C Computer Science, Part B

Abstract

Bisimulation and simulation are relations that can be used for state compression in Markov chains. The aim of this project is to understand, implement and compare algorithms for computing these relations. Such algorithms could involve subprocedures for solving the max-flow problem or computing matrix eigenvalues.