On the use of model and logical embeddings for model checking of probabilistic systems
DOI10.1007/978-3-031-35355-0_8zbMATH Open1543.68203MaRDI QIDQ6535466
Publication date: 11 January 2024
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability and inductive logic (03B48) Specification and verification (program logics, model checking, etc.) (68Q60) 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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic logical characterization
- Probabilistic and prioritized models of timed CSP
- LOTOS extended with probabilistic behaviours
- A logic for reasoning about time and reliability
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Comparative branching-time semantics for Markov chains
- On-the-Fly Model Checking for Extended Action-Based Probabilistic Operators
- On the equivalence of game and denotational semantics for the probabilistic mu-calculus
- CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
- Probabilistic modal {\mu}-calculus with independent product
- Formal Modeling and Analysis of Timed Systems
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
This page was built for publication: On the use of model and logical embeddings for model checking of probabilistic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535466)
