The following pages link to PRISM (Q13928):
Displaying 50 items.
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Analysis of a clock synchronization protocol for wireless sensor networks (Q764293) (← links)
- Probabilistic model checking of biological systems with uncertain kinetic rates (Q764350) (← links)
- Bio-PEPAd: a non-Markovian extension of Bio-PEPA (Q764354) (← links)
- Formal abstraction and synthesis of parametric stochastic processes (Q832046) (← links)
- Tweaking the odds in probabilistic timed automata (Q832050) (← links)
- Abstraction-guided truncations for stationary distributions of Markov population models (Q832087) (← links)
- Lumpability for uncertain continuous-time Markov chains (Q832091) (← links)
- Model checking \(\omega \)-regular properties with decoupled search (Q832281) (← links)
- Model checking finite-horizon Markov chains with probabilistic inference (Q832295) (← links)
- Model-free reinforcement learning for branching Markov decision processes (Q832301) (← links)
- State explosion in almost-sure probabilistic reachability (Q846015) (← links)
- Performance analysis of probabilistic timed automata using digital clocks (Q853731) (← links)
- Probable innocence revisited (Q860902) (← links)
- Formal techniques for performance analysis: blending SAN and PEPA (Q877152) (← links)
- A one-shot deviation principle for stability in matching problems (Q894006) (← links)
- Minimal probabilistic P systems for modelling ecological systems (Q896706) (← links)
- Multiphase until formulas over Markov reward models: an algebraic approach (Q896909) (← links)
- Formal probabilistic analysis of detection properties in wireless sensor networks (Q903510) (← links)
- Integrating stochastic reasoning into Event-B development (Q903513) (← links)
- Minimization of probabilistic models of programs (Q906254) (← links)
- Reachability in recursive Markov decision processes (Q924718) (← links)
- Using probabilistic Kleene algebra pKA for protocol verification (Q929968) (← links)
- Analysing distributed internet worm attacks using continuous state-space approximation of process algebra models (Q941454) (← links)
- Query-based verification of qualitative trends and oscillations in biochemical systems (Q969178) (← links)
- Hybrid dynamics of stochastic programs (Q969181) (← links)
- Abstract interpretation based verification of temporal properties for BioAmbients (Q989287) (← links)
- Mixing logics and rewards for the component-oriented specification of performance measures (Q995461) (← links)
- CSL model checking algorithms for QBDs (Q995462) (← links)
- Model checking mobile stochastic logic (Q995465) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- Assisting the design of a groupware system - Model checking usability aspects of thinkteam (Q1014561) (← links)
- Performance analysis and functional verification of the stop-and-wait protocol in HOL (Q1040781) (← links)
- A note on the attractor-property of infinite-state Markov chains (Q1045897) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- Model-checking large structured Markov chains. (Q1400291) (← links)
- Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol (Q1402478) (← links)
- Fun with fireWire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol (Q1402480) (← links)
- Computer performance evaluation. Modelling techniques and tools. 12th international conference, TOOLS 2002, London, GB, April 14--17, 2002. Proceedings (Q1611713) (← links)
- Models of transcription factor binding: sensitivity of activation functions to model assumptions (Q1617602) (← links)
- Imperfect information in reactive modules games (Q1641035) (← links)
- Performance limits and trade-offs in entropy-driven biochemical computers (Q1649423) (← links)
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors (Q1651010) (← links)
- Modeling and analysis of the obstacle-avoidance strategies for a mobile robot in a dynamic environment (Q1666714) (← links)
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria (Q1676496) (← links)
- Probabilistic timed automata with clock-dependent probabilities (Q1685793) (← links)
- Learning deterministic probabilistic automata from a model checking perspective (Q1689574) (← links)
- Uniform sampling for timed automata with application to language inclusion measurement (Q1693099) (← links)
- Verification and control of partially observable probabilistic systems (Q1699230) (← links)
- Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
