Next Article in Journal
Study of Precipitation Forecast Based on Deep Belief Networks
Previous Article in Journal
Numerical Modeling of Wave Disturbances in the Process of Ship Movement Control
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(9), 131; https://doi.org/10.3390/a11090131

An Efficient Algorithm to Determine Probabilistic Bisimulation

Department of Mathematics and Computer Science, Eindhoven Universtiy of Technology, P.O. Box 512, 5600 MB Eindhoven, The Netherlands
*
Author to whom correspondence should be addressed.
Received: 10 July 2018 / Revised: 20 August 2018 / Accepted: 27 August 2018 / Published: 3 September 2018
(This article belongs to the Special Issue Bisimulation and Simulation Algorithms)
Full-Text   |   PDF [920 KB, uploaded 5 September 2018]   |  

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 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. View Full-Text
Keywords: probabilistic system with nondeterminism; probabilistic labeled transition system; probabilistic bisimulation; partition-refinement algorithm probabilistic system with nondeterminism; probabilistic labeled transition system; probabilistic bisimulation; partition-refinement algorithm
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Groote, J.F.; Rivera Verduzco, J.; de Vink, E.P. An Efficient Algorithm to Determine Probabilistic Bisimulation. Algorithms 2018, 11, 131.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top