A definition scheme for quantitative bisimulation

DOI10.4204/EPTCS.194.5MaRDI QIDQ7031239zbMATH OpenFDO

Authors Diego Latella, Mieke Massink, Erik de Vink

Publication date 6 February 2025

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4204/EPTCS.194.5

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A coalgebraic perspective on linear weighted automata
• A Compositional Approach to Performance Modelling
• A hierarchy of probabilistic system types
• A spectrum of behavioral relations over LTSs on probability distributions
• A uniform definition of stochastic process calculi
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• Bisimulation and Simulation Relations for Markov Chains
• Bisimulation of labelled state-to-function transition systems coalgebraically
• Bisimulation through probabilistic testing
• Branching bisimulation congruence for probabilistic systems
• Coalgebraic weak bisimulation for action-type systems
• Concurrency and composition in a stochastic world
• Efficient modelling and generation of Markov automata
• Exploring probabilistic bisimulations. I
• GSOS for non-deterministic processes with quantitative aspects
• scientific article; zbMATH DE number 1753205 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• Interactive Markov chains. And the quest for quantified quality
• Labelled Markov processes.
• On tree coalgebras and coalgebra presentations
• Probabilistic systems coalgebraically: a survey
• Rate-Based Transition Systems for Stochastic Process Calculi
• Relating coalgebraic notions of bisimulation
• Structural Operational Semantics for Stochastic Process Calculi
• Structural Operational Semantics for Weighted Transition Systems
• The how and why of interactive Markov chains
• Universal coalgebra: A theory of systems

Cited in

(1)

• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication: A definition scheme for quantitative bisimulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031239)