Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline

Journals

Article Types

Countries / Regions

remove_circle_outline

Search Results (1)

Search Parameters:
Keywords = probabilistic system with nondeterminism

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
22 pages, 920 KB  
Article
An Efficient Algorithm to Determine Probabilistic Bisimulation
by Jan Friso Groote, Jao Rivera Verduzco and Erik P. De Vink
Algorithms 2018, 11(9), 131; https://doi.org/10.3390/a11090131 - 3 Sep 2018
Cited by 19 | Viewed by 4712
Abstract
We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as discrete probabilistic choice. The algorithm is linear in the number of transitions and logarithmic in the number of states, distinguishing both action states and [...] Read more.
We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as discrete probabilistic choice. The algorithm is linear in the number of transitions and logarithmic in the number of states, distinguishing both action states and probabilistic states, and the transitions between them. The algorithm improves upon the proposed complexity bounds of the best algorithm addressing the same purpose so far by Baier, Engelen and Majster-Cederbaum (Journal of Computer and System Sciences 60:187–231, 2000). In addition, experimentally, on various benchmarks, our algorithm performs rather well; even on relatively small transition systems, a performance gain of a factor 10,000 can be achieved. Full article
(This article belongs to the Special Issue Bisimulation and Simulation Algorithms)
Show Figures

Figure 1

Back to TopTop