scientific article; zbMATH DE number 7204557
From MaRDI portal
Publication:5111437
Modal logic (including the logic of norms) (03B45) Probability and inductive logic (03B48) Descriptive set theory (03E15) 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
- Expressiveness of probabilistic modal logics: a gradual approach
- Probability logic: A model-theoretic perspective
- Probabilistic models for intuitionistic predicate logic
- scientific article; zbMATH DE number 1123884
- Probabilities on sentences in an expressive logic
- scientific article; zbMATH DE number 4016864
- Decidability and expressiveness for first-order logics of probability
- Probability semantics for quantifier logic
- Modal logics with several operators and probability interpretations
- scientific article; zbMATH DE number 4066847
Cited in
(19)- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Towards a classification of behavioural equivalences in continuous-time Markov processes
- Expressiveness of probabilistic modal logics: a gradual approach
- Probabilities on sentences in an expressive logic
- Bisimulation for labelled Markov processes
- Probabilistic Modal μ-Calculus with Independent Product
- Bisimulations for non-deterministic labelled Markov processes
- scientific article; zbMATH DE number 1241665 (Why is no real title available?)
- Some considerations on the logics PFD A logic combining modality and probability
- scientific article; zbMATH DE number 1844478 (Why is no real title available?)
- (Metric) bisimulation games and real-valued modal logics for coalgebras
- Bisimilarity is not Borel
- Unprovability of the logical characterization of bisimulation
- Computing probabilistic bisimilarity distances for probabilistic automata
- Computing probabilistic bisimilarity distances for probabilistic automata
- Proving behavioural apartness
- Composing codensity bisimulations
- Convex language semantics for nondeterministic probabilistic automata
- Explainability is a game for probabilistic bisimilarity distances
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111437)