Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
The Complexity of Computing a...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
Bibliographic Details
Main Authors:
van Breugel, F
,
Worrell, J
Format:
Book
Published:
2014
Holdings
Description
Similar Items
Staff View
Description
Summary:
Similar Items
On the Complexity of Computing Probabilistic Bisimilarity
by: Chen, D, et al.
Published: (2012)
Computing probabilistic bisimilarity distances for probabilistic automata
by: Bacci, G, et al.
Published: (2021)
Deciding probabilistic bisimilarity distance one for probabilistic automata
by: Tang, Q, et al.
Published: (2020)
APPROXIMATING A BEHAVIOURAL PSEUDOMETRIC WITHOUT DISCOUNT FOR PROBABILISTIC SYSTEMS
by: Van Breugel, F, et al.
Published: (2008)
Game characterization of probabilistic bisimilarity, and applications to pushdown automata
by: Forejt, V, et al.
Published: (2018)