The following pages link to PRISM (Q13928):
Displaying 50 items.
- Model checking expected time and expected reward formulae with random time bounds (Q2494794) (← links)
- Statistical probabilistic model checking with a focus on time-bounded properties (Q2509358) (← links)
- Verification of spatial and temporal modalities in biochemical systems (Q2520667) (← links)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731) (← links)
- Using probabilistic model checking for dynamic power management (Q2576577) (← links)
- Probabilistic guarded commands mechanized in HOL (Q2576950) (← links)
- A proof theoretic view of spatial and temporal dependencies in biochemical systems (Q2628774) (← links)
- A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions (Q2636513) (← links)
- Interval iteration algorithm for MDPs and IMDPs (Q2636515) (← links)
- Least upper bounds for probability measures and their applications to abstractions (Q2637319) (← links)
- The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
- EthVer: formal verification of randomized Ethereum smart contracts (Q2670859) (← links)
- Value iteration for simple stochastic games: stopping criterion and learning algorithm (Q2672267) (← links)
- Model checking differentially private properties (Q2680992) (← links)
- A Tool for the Automated Verification of Nash Equilibria in Concurrent Games (Q2787450) (← links)
- An inductive technique for parameterised model checking of degenerative distributed randomised protocols (Q2810974) (← links)
- Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata (Q2814125) (← links)
- Finite-Horizon Bisimulation Minimisation for Probabilistic Systems (Q2814625) (← links)
- Probabilistic Time Petri Nets (Q2822657) (← links)
- Efficient Decomposition Algorithm for Stationary Analysis of Complex Stochastic Petri Net Models (Q2822659) (← links)
- Mean-Field Limits Beyond Ordinary Differential Equations (Q2822663) (← links)
- Quantitative Abstractions for Collective Adaptive Systems (Q2822665) (← links)
- On-the-fly Fast Mean-Field Model-Checking (Q2830041) (← links)
- Chemical Reaction Network Designs for Asynchronous Logic Circuits (Q2835704) (← links)
- A static analysis framework for livelock freedom in CSP (Q2848369) (← links)
- Simplifying Itai-Rodeh leader election for anonymous rings (Q2848414) (← links)
- Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC (Q2848422) (← links)
- A Probabilistic Strategy Language for Probabilistic Rewrite Theories and Its Application to Cloud Computing (Q2848872) (← links)
- Automatic analysis of a non-repudiation protocol (Q2849849) (← links)
- Advances in Quantitative Verification for Ubiquitous Computing (Q2851899) (← links)
- Using Agent JPF to Build Models for Other Model Checkers (Q2851976) (← links)
- Automated game analysis via probabilistic model checking: a case study (Q2852033) (← links)
- Weak probabilistic anonymity (Q2864392) (← links)
- Simulation of generalised semi-Markov processes based on graph transformation systems (Q2867890) (← links)
- Reflections on the future of concurrency theory in general and process calculi in particular (Q2870196) (← links)
- PEPA queues: capturing customer behaviour in queueing networks (Q2870281) (← links)
- Exogenous probabilistic computation tree logic (Q2870286) (← links)
- Adaptive and sequential gridding procedures for the abstraction and verification of stochastic processes (Q2871352) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Refinement and difference for probabilistic automata (Q2878759) (← links)
- Synthesizing Efficient Controllers (Q2891434) (← links)
- Minimal Critical Subsystems for Discrete-Time Markov Models (Q2894278) (← links)
- Automatic Verification of Competitive Stochastic Systems (Q2894279) (← links)
- Verifying pCTL Model Checking (Q2894281) (← links)
- A Platform for High Performance Statistical Model Checking – PLASMA (Q2894294) (← links)
- Generalized Craig interpolation for stochastic Boolean satisfiability problems with applications to probabilistic state reachability and region stability (Q2895477) (← links)
- Probabilistic Graph Transformation Systems (Q2918991) (← links)
- SMT-Based Bisimulation Minimisation of Markov Models (Q2926637) (← links)
- Infinite probability computation by cyclic explanation graphs (Q2933089) (← links)
