Expressiveness of probabilistic modal logics: a gradual approach
DOI10.1016/j.ic.2019.04.002zbMath1422.68167OpenAlexW2944100452WikidataQ127906402 ScholiaQ127906402MaRDI QIDQ2417857
Prakash Panangaden, Nathanaël Fijalkow, Bartek Klin, Florence Clerc
Publication date: 29 May 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2019.04.002
Polish spaceprobabilistic simulationprobabilistic bisimulationanalytic setprobabilistic modal logiclabelled Markov process
Descriptive set theory (03E15) Modal logic (including the logic of norms) (03B45) Probability and inductive logic (03B48) 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)
Related Items (4)
Cites Work
- Unprovability of the logical characterization of bisimulation
- Metrics for labelled Markov processes
- Bisimulation through probabilistic testing
- Approximating labelled Markov processes
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- Exemplaric Expressivity of Modal Logics
- Algebraic laws for nondeterminism and concurrency
- (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Expressiveness of probabilistic modal logics: a gradual approach
