The following pages link to PRISM (Q13928):
Displaying 50 items.
- Optimal cost almost-sure reachability in POMDPs (Q253969) (← links)
- Smoothed model checking for uncertain continuous-time Markov chains (Q259074) (← links)
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Modular verification of chemical reaction network encodings via serializability analysis (Q288812) (← links)
- A strand graph semantics for DNA-based computation (Q288814) (← links)
- Synthesizing efficient systems in probabilistic environments (Q300419) (← links)
- A computationally grounded, weighted doxastic logic (Q310087) (← links)
- Command-based importance sampling for statistical model checking (Q313977) (← links)
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- Model checking learning agent systems using Promela with embedded C code and abstraction (Q333329) (← links)
- Analysis of stochastic matching markets (Q378330) (← links)
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- Characterization and computation of infinite-horizon specifications over Markov processes (Q386604) (← links)
- Discussion on: ``Safety verification for probabilistic hybrid systems'' (Q389836) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Combined model checking for temporal, probabilistic, and real-time logics (Q407511) (← links)
- Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths (Q420803) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Automated technology for verification and analysis. 12th international symposium, ATVA 2014, Sydney, NSW, Australia, November 3--7, 2014. Proceedings (Q464749) (← links)
- Randomized sampling for large zero-sum games (Q490542) (← links)
- Semi-automated verification of security proofs of quantum cryptographic protocols (Q491263) (← links)
- Theory and applications of models of computation. 12th annual conference, TAMC 2015, Singapore, May 18--20, 2015. Proceedings (Q491669) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Applications of an expressive statistical model checking approach to the analysis of genetic circuits (Q498908) (← links)
- Confluence reduction for Markov automata (Q507382) (← links)
- The virtues of idleness: a decidable fragment of resource agent logic (Q514142) (← links)
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata (Q517046) (← links)
- The modeling library of eavesdropping methods in quantum cryptography protocols by model checking (Q518056) (← links)
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (Q518409) (← links)
- Dynamic Bayesian networks for formal verification of structured stochastic processes (Q523135) (← links)
- Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement (Q533361) (← links)
- Probabilistic approximations of ODEs based bio-pathway dynamics (Q533363) (← links)
- Property specifications for workflow modelling (Q549695) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications (Q600975) (← links)
- A game-based abstraction-refinement framework for Markov decision processes (Q600979) (← links)
- Spatial calculus of looping sequences (Q652132) (← links)
- Generating counterexamples for quantitative safety specifications in probabilistic B (Q652160) (← links)
- Formal reliability analysis of redundancy architectures (Q667523) (← links)
- Safe autonomy under perception uncertainty using chance-constrained temporal logic (Q682357) (← links)
- A formal verification technique for behavioural model-to-model transformations (Q682361) (← links)
- Model-based testing of probabilistic systems (Q682363) (← links)
- Modular modelling of signalling pathways and their cross-talk (Q714863) (← links)
- A labelling framework for probabilistic argumentation (Q722102) (← links)
- Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing (Q736791) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Probability timed automata for investigating communication processes (Q747506) (← links)
