Late Weak Bisimulation for Markov Automata
Formal Languages and Automata Theory
2014-01-15 v2
Abstract
Weak bisimilarity is a distribution-based equivalence notion for Markov automata. It has gained some popularity as the coarsest reasonable behavioural equivalence on Markov automata. This paper studies a strictly coarser notion: Late weak bisimilarity enjoys valuable properties if restricting to important subclasses of schedulers: Trace distribution equivalence is implied for partial information schedulers, and compositionality is preserved by distributed schedulers. The intersection of the two scheduler classes thus spans a coarser and still reasonable compositional theory of Markov automata.
Keywords
Cite
@article{arxiv.1202.4116,
title = {Late Weak Bisimulation for Markov Automata},
author = {Christian Eisentraut and Jens Chr. Godskesen and Holger Hermanns and Lei Song and Lijun Zhang},
journal= {arXiv preprint arXiv:1202.4116},
year = {2014}
}