Logical characterization of trace metrics
From MaRDI portal
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites work
- A behavioural pseudometric for probabilistic transition systems
- A logic for reasoning about time and reliability
- Algebraic laws for nondeterminism and concurrency
- Behavioural pseudometrics for nondeterministic probabilistic systems
- CONCUR 2005 – Concurrency Theory
- Converging from Branching to Linear Metrics on Markov Chains
- Formal verification of parallel programs
- Game Refinement Relations and Metrics
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 1754609 (Why is no real title available?)
- Linear distances between Markov chains
- Logical characterization of bisimulation metrics
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- Metrics for action-labelled quantitative transition systems
- Metrics for labelled Markov processes
- Modal decomposition on nondeterministic probabilistic processes
- Precongruence formats for decorated trace semantics
- Probabilistic logical characterization
- Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
- Sós specifications of probabilistic systems by uniformly continuous operators
- Taking it to the limit: approximate reasoning for Markov processes
Cited in
(1)
This page was built for publication: Logical characterization of trace metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021647)
