• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains.

David N. JansenJan Friso GrooteFerry TimmersPengfei Yang
Published in: CONCUR (2020)
Keyphrases
  • markov chain
  • markov model
  • worst case
  • monte carlo
  • matching algorithm
  • dynamic programming
  • learning algorithm
  • expectation maximization
  • steady state
  • optimal solution
  • search space
  • theoretical guarantees