The following pages link to A probabilistic PDL (Q1063584):
Displaying 50 items.
- Extending propositional dynamic logic for Petri nets (Q281154) (← links)
- A metrized duality theorem for Markov processes (Q283765) (← links)
- A pseudometric in supervisory control of probabilistic discrete event systems (Q351739) (← links)
- Discussion on: ``Safety verification for probabilistic hybrid systems'' (Q389836) (← links)
- Approximating Markov processes through filtration (Q442296) (← links)
- A stochastic interpretation of game logic (Q516033) (← links)
- A logical duality for underspecified probabilistic systems (Q532396) (← links)
- Metrics for labelled Markov processes (Q596029) (← links)
- A probabilistic dynamic logic (Q792757) (← links)
- Decidability of finite probabilistic propositional dynamic logics (Q809069) (← links)
- Latticed \(k\)-induction with an application to probabilistic programs (Q832288) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- Measure and probability for concurrency theorists (Q1589655) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- A behavioural pseudometric for probabilistic transition systems (Q1770428) (← links)
- A logic for reasoning about probabilities (Q1813497) (← links)
- A propositional dynamic logic with qualitative probabilities (Q1961927) (← links)
- Moment-based analysis of Bayesian network properties (Q2072070) (← links)
- A semantics and a logic for \textit{Fuzzy Arden Syntax} (Q2099984) (← links)
- Formal semantics of a classical-quantum language (Q2123052) (← links)
- Quantitative logics for equivalence of effectful programs (Q2133179) (← links)
- A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
- Hennessy-Milner results for probabilistic PDL (Q2133481) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- Probabilization of logics: completeness and decidability (Q2254552) (← links)
- Quantitative static analysis of communication protocols using abstract Markov chains (Q2322314) (← links)
- Reasoning about probabilistic sequential programs (Q2373709) (← links)
- An exercise on the generation of many-valued dynamic logics (Q2374313) (← links)
- Program algebra for quantitative information flow (Q2423771) (← links)
- Real-reward testing for probabilistic processes (Q2453107) (← links)
- Bisimulation for labelled Markov processes (Q2506488) (← links)
- Probabilistic guarded commands mechanized in HOL (Q2576950) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- Categories of Timed Stochastic Relations (Q2805158) (← links)
- Approximating Labelled Markov Processes Again! (Q2888484) (← links)
- Semantics of Probabilistic Programs: A Weak Limit Approach (Q2937792) (← links)
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC (Q3021957) (← links)
- Reverse Hoare Logic (Q3095238) (← links)
- A Demonic Approach to Information in Probabilistic Systems (Q3184680) (← links)
- Temporalization of Probabilistic Propositional Logic (Q3605519) (← links)
- Symbolic model checking for probabilistic processes (Q4571974) (← links)
- A Type Theory for Probabilistic and Bayesian Reasoning (Q4580222) (← links)
- Probabilistic Temporal Logics (Q5024714) (← links)
- Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular (Q5079754) (← links)
- (Q5094116) (← links)
- Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs (Q5200042) (← links)
- (Q5214813) (← links)
- Probabilistic Logic over Paths (Q5415665) (← links)
- Hidden-Markov program algebra with iteration (Q5740625) (← links)
- Approximating Markov Processes by Averaging (Q5895176) (← links)
