A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces

DOI10.1016/j.tcs.2020.12.045zbMath1497.68347OpenAlexW3118321919MaRDI QIDQ831141

Ruggero Lanotte, Simone Tini

Publication date: 10 May 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.045

zbMATH Keywords

nondeterminismcontinuous state spacecyber-physical systemsweak bisimulation metric

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• Branching bisimulation congruence for probabilistic systems
• Raiders of the lost equivalence: probabilistic branching bisimilarity
• Stability of a 4th-order curvature condition arising in optimal transport theory
• Bisimulation through probabilistic testing
• A logic for reasoning about time and reliability
• The theory of interactive generalized semi-Markov processes
• Weak bisimulation metrics in models with nondeterminism and continuous state spaces
• Behavioural pseudometrics for nondeterministic probabilistic systems
• SOS specifications for uniformly continuous operators
• A behavioural pseudometric for probabilistic transition systems
• A process algebra for timed systems
• Probabilistic divide \& congruence: branching bisimilarity
• A probabilistic calculus of cyber-physical systems
• A compositional modelling and analysis framework for stochastic hybrid systems
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems
• Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
• A compositional modelling and verification framework for stochastic hybrid systems
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Computing Behavioral Distances, Compositionally
• Taking It to the Limit: Approximate Reasoning for Markov Processes
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• Measurability and safety verification for stochastic hybrid systems
• Metric Reasoning About $$\lambda $$-Terms: The General Case
• Generalized Bisimulation Metrics
• Game Refinement Relations and Metrics
• Characterising Testing Preorders for Finite Probabilistic Processes
• Formal verification of parallel programs
• Converging from branching to linear metrics on Markov chains
• Metric reasoning about λ-terms: The affine case
• Weak Simulation Quasimetric in a Gossip Scenario
• Monads and Quantitative Equational Theories for Nondeterminism and Probability
• Compositional weak metrics for group key update
• Hybrid Systems: Computation and Control
• Measures, Integrals and Martingales
• Hybrid Systems: Computation and Control
• Foundations of Software Science and Computational Structures
• A Calculus of Cyber-Physical Systems

This page was built for publication: A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces