The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

Схожие документы

• On the Complexity of Computing Probabilistic Bisimilarity
  по: Chen, D, и др.
  Опубликовано: (2012)
• Computing probabilistic bisimilarity distances for probabilistic automata
  по: Bacci, G, и др.
  Опубликовано: (2021)
• Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
  по: Giorgio Bacci, и др.
  Опубликовано: (2021-02-01)
• Deciding probabilistic bisimilarity distance one for probabilistic automata
  по: Tang, Q, и др.
  Опубликовано: (2020)
• APPROXIMATING A BEHAVIOURAL PSEUDOMETRIC WITHOUT DISCOUNT FOR PROBABILISTIC SYSTEMS
  по: Van Breugel, F, и др.
  Опубликовано: (2008)