Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
From MaRDI portal
Logic in computer science (03B70) Formal languages and automata (68Q45) 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)
Recommendations
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Logical characterizations of behavioral relations on transition systems of probability distributions
- Probabilistic logical characterization
- Expressiveness of probabilistic modal logics: a gradual approach
- Group-by-group probabilistic bisimilarities and their logical characterizations
Cited in
(41)- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Logical characterisation of parameterised bisimulations
- Probabilistic bisimilarity as testing equivalence
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
- Exploring probabilistic bisimulations. I
- Probabilistic divide \& congruence: branching bisimilarity
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Weak bisimulation is sound and complete for pCTL\(^*\)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- Trace semantics via determinization
- A space-efficient simulation algorithm on probabilistic automata
- Group-by-group probabilistic bisimilarities and their logical characterizations
- A general framework for probabilistic characterizing formulae
- A theory for the semantics of stochastic and non-deterministic continuous systems
- Logical characterizations of behavioral relations on transition systems of probability distributions
- Probabilistic bisimulation and simulation algorithms by abstract interpretation
- scientific article; zbMATH DE number 2186294 (Why is no real title available?)
- Bisimulations meet PCTL equivalences for probabilistic automata
- A spectrum of behavioral relations over LTSs on probability distributions
- On Almost-Sure Properties of Probabilistic Discrete Event Systems
- Bisimulations for non-deterministic labelled Markov processes
- Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Termination in convex sets of distributions
- Bisimulations, logics, and trace distributions for stochastic systems with rewards
- SOS-based modal decomposition on nondeterministic probabilistic processes
- Logical characterization of bisimulation for transition relations over probability distributions with internal actions
- Bisimulations for probabilistic and quantum processes (invited paper)
- Differential privacy in probabilistic systems
- Bisimulations meet PCTL equivalences for probabilistic automata
- A logical duality for underspecified probabilistic systems
- Probabilistic logical characterization
- On the use of model and logical embeddings for model checking of probabilistic systems
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Logical characterization of branching bisimilarity over random processes
- Uniform logical characterizations of testing equivalences for nondeterministic, probabilistic and Markovian processes
- Logical characterization of trace metrics
- Logical characterization of bisimulation metrics
- Branching bisimulation congruence for probabilistic systems
This page was built for publication: Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758058)
