A Definition Scheme for Quantitative Bisimulation
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 bisimulat...
Main Authors: | Diego Latella, Mieke Massink, Erik de Vink |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2015-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1509.08563v1 |
Similar Items
-
Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
by: Diego Latella, et al.
Published: (2015-12-01) -
Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages
by: D. Latella, et al.
Published: (2012-08-01) -
Lowerbounds for Bisimulation by Partition Refinement
by: Jan Friso Groote, et al.
Published: (2023-05-01) -
Coherent branching feature bisimulation
by: Tessa Belder, et al.
Published: (2015-04-01) -
An Efficient Algorithm to Determine Probabilistic Bisimulation
by: Jan Friso Groote, et al.
Published: (2018-09-01)