Paper Info
Title
A Definition Scheme For Quantitative Bisimulation
Abstract
FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata. A general scheme for the definition of a notion of strong bisimulation associated with a FuTS is proposed. It is shown that this notion of bisimulation for a FuTS coincides with the coalgebraic notion of behavioral equivalence associated to the functor on Set given by the type of the FuTS. For a series of concrete quantitative semantical models the notion of bisimulation as reported in the literature is proven to coincide with the notion of quantitative bisimulation obtained from the scheme. The comparison includes models with orthogonal behaviour, like interactive Markov chains, and with multiple levels of behavior, like Markov automata. As a consequence of the general result relating FuTS bisimulation and behavioral equivalence we obtain, in a systematic way, a coalgebraic underpinning of all quantitative bisimulations discussed.
Year
DOI
Venue
2015
10.4204/EPTCS.194.5
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE
Keywords
Field
DocType
quantitative automata, state-to-function transition system, bisimulation
Discrete mathematics,Algebra,Generalization,Automaton,Markov chain,Functor,Equivalence (measure theory),Bisimulation,Mathematics
Journal
Issue
ISSN
Citations 
194
2075-2180
0
PageRank 
References 
Authors
0.34
9
3
Name
Order
Citations
PageRank
Diego Latella11168113.42
Mieke Massink2109587.58
Erik P. de Vink337428.76