Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This paper develops a decision algorithm for weak bisimulation on Markov Automata (MA). For this purpose, different notions of vanishing states (a concept originating from the area of Generalised Stochastic Petri Nets) are defined. In particular, non-naïvely vanishing states are shown to be essential for relating the concepts of (state-based) naïve weak bisimulation and (distribution-based) weak bisimulation. The bisimulation algorithm presented here follows the partition-refinement scheme and has exponential time complexity. © 2014 Elsevier Inc.

Cite

CITATION STYLE

APA

Schuster, J., & Siegle, M. (2014). Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states. Information and Computation, 237, 151–173. https://doi.org/10.1016/j.ic.2014.02.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free