Quantitative relations and approximate process equivalences.

DOI10.1007/B11938MaRDI QIDQ5900586zbMATH OpenOpenAlexFDO

Authors Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky

Publication date 30 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11938

Mathematics Subject Classification ID

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

Recommendations

• Metrics for labelled Markov processes
• Approximating and computing behavioural distances in probabilistic transition systems
• Probabilistic extensions of process algebras.
• scientific article; zbMATH DE number 1956514
• scientific article; zbMATH DE number 1696897

Cited in

(14)

• The approximate correctness of systems based on \(\delta\)-bisimulation
• A unified framework for differential aggregations in Markovian process algebra
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems
• On finite-state approximants for probabilistic computation tree logic
• Quantitative abstractions for collective adaptive systems
• On probabilistic techniques for data flow analysis
• Value-passing CCS with noisy channels
• Approximate testing equivalence based on time, probability, and observed behavior
• A behavioural pseudometric based on -bisimilarity
• Measuring the confinement of probabilistic systems
• Reversible monadic computing
• Approximate bisimulation: a bridge between computer science and control theory
• Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
• Tempus fugit: How to plug it

This page was built for publication: Quantitative relations and approximate process equivalences.

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