Logical characterization of bisimulation metrics
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 2038772 (Why is no real title available?)
- scientific article; zbMATH DE number 1864592 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- scientific article; zbMATH DE number 6774228 (Why is no real title available?)
- A behavioural pseudometric for probabilistic transition systems
- A general framework for probabilistic characterizing formulae
- A modal characterization of observational congruence on finite terms of CCS
- Algebraic laws for nondeterminism and concurrency
- Automata, Languages and Programming
- Bisimulation for labelled Markov processes
- Bisimulation through probabilistic testing
- Bisimulations for non-deterministic labelled Markov processes
- Characterising Testing Preorders for Finite Probabilistic Processes
- Characterising probabilistic processes logically (extended abstract)
- Characteristic formulae for fixed-point semantics: a general framework
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Compositional metric reasoning with probabilistic process calculi
- Compositionality of Hennessy-Milner logic by structural operational semantics
- Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
- Continuous Markovian logics -- axiomatization and quantified metatheory
- Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
- Exploring probabilistic bisimulations. I
- Fixed-point characterization of compositionality properties of probabilistic processes combinators
- Formal verification of parallel programs
- Foundations of Security Analysis and Design II
- Foundations of Software Science and Computational Structures
- Game Refinement Relations and Metrics
- Generalized 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
- Non Expansive ε-Bisimulations
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- On behavioural pseudometrics and closure ordinals
- Optimal Transport
- Precongruence formats for decorated trace semantics
- Probabilistic Bisimulation: Naturally on Distributions
- Probabilistic bisimulation as a congruence
- Probabilistic logical characterization
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Revisiting bisimilarity and its modal logic 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
- The quantitative linear-time-branching-time spectrum
Cited in
(4)
This page was built for publication: Logical characterization of bisimulation metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021658)
