Logical characterization of branching metrics for nondeterministic probabilistic transition systems
From MaRDI portal
Publication:2272986
Recommendations
- Behavioural pseudometrics for nondeterministic probabilistic systems
- Characterising probabilistic processes logically (extended abstract)
- Automata, Languages and Programming
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- Logical characterizations of behavioral relations on transition systems of probability distributions
Cites work
- scientific article; zbMATH DE number 7447772 (Why is no real title available?)
- scientific article; zbMATH DE number 2038772 (Why is no real title available?)
- scientific article; zbMATH DE number 1754609 (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?)
- A behavioural pseudometric for probabilistic transition systems
- A general SOS theory for the specification of probabilistic transition systems
- A general framework for probabilistic characterizing formulae
- A lattice-theoretical fixpoint theorem and its applications
- A logic for reasoning about time and reliability
- A modal characterization of observational congruence on finite terms of CCS
- Algebraic laws for nondeterminism and concurrency
- Bisimulation for labelled Markov processes
- Bisimulation through probabilistic testing
- Bisimulations for non-deterministic labelled Markov processes
- Chain-complete posets and directed sets with applications
- Characterising probabilistic processes logically (extended abstract)
- Characteristic formulae for fixed-point semantics: a general framework
- Characteristic formulae for processes with divergence
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Compositional metric reasoning with probabilistic process calculi
- Compositional weak metrics for group key update
- Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
- Continuous Markovian logics -- axiomatization and quantified metatheory
- Converging from Branching to Linear Metrics on Markov Chains
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Distribution-based bisimulation for labelled Markov processes
- Equational reasonings in wireless network gossip protocols
- Exploring probabilistic bisimulations. I
- Formal verification of parallel programs
- Foundations of Security Analysis and Design II
- Game Refinement Relations and Metrics
- Generalized Bisimulation Metrics
- Linear distances between Markov chains
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- Metrics for labelled Markov processes
- Modal decomposition on nondeterministic probabilistic processes
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- Observing branching structure through probabilistic contexts
- On behavioural pseudometrics and closure ordinals
- Probabilistic bisimulation as a congruence
- Probabilistic logical characterization
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Quantitative relations and approximate process equivalences.
- Results on the propositional \(\mu\)-calculus
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- SOS specifications for uniformly continuous operators
- SOS-based modal decomposition on nondeterministic probabilistic processes
- Sós specifications of probabilistic systems by uniformly continuous operators
- Taking it to the limit: approximate reasoning for Markov processes
- Weak bisimulation metrics in models with nondeterminism and continuous state spaces
Cited in
(9)- Probabilistic divide \& congruence: branching bisimilarity
- scientific article; zbMATH DE number 7566075 (Why is no real title available?)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- Automata, Languages and Programming
- SOS specifications for uniformly continuous operators
- Weighted branching systems: behavioural equivalence, behavioural distance, and their logical characterisations
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- Computing bisimilarity metrics for probabilistic timed automata
This page was built for publication: Logical characterization of branching metrics for nondeterministic probabilistic transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272986)
