The following pages link to PRISM (Q13928):
Displaying 50 items.
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination (Q2182734) (← links)
- Collaborative models for autonomous systems controller synthesis (Q2198131) (← links)
- PuRSUE -- from specification of robotic environments to synthesis of controllers (Q2198133) (← links)
- Multi-cost bounded tradeoff analysis in MDP (Q2208304) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Multi-scale verification of distributed synchronisation (Q2225471) (← links)
- Exact quantitative probabilistic model checking through rational search (Q2225475) (← links)
- Automaton-ABC: a statistical method to estimate the probability of spatio-temporal properties for parametric Markov population models (Q2238218) (← links)
- An extension of the inverse method to probabilistic timed automata (Q2248053) (← links)
- Automatic verification of competitive stochastic systems (Q2248068) (← links)
- Preface to the special issue on probabilistic model checking (Q2248070) (← links)
- Model checking for probabilistic timed automata (Q2248072) (← links)
- A compositional modelling and analysis framework for stochastic hybrid systems (Q2248073) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- On-the-fly verification and optimization of DTA-properties for large Markov chains (Q2248080) (← links)
- Bayesian statistical model checking with application to Stateflow/Simulink verification (Q2248081) (← links)
- Some notes on the abstraction operation for multi-terminal binary decision diagrams (Q2248099) (← links)
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Q2257302) (← links)
- An AGM-style belief revision mechanism for probabilistic spatio-temporal logics (Q2269133) (← links)
- Bio-PEPA: A framework for the modelling and analysis of biological systems (Q2271444) (← links)
- Faster statistical model checking for unbounded temporal properties (Q2272915) (← links)
- Natural strategic ability (Q2289013) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Quantitative static analysis of communication protocols using abstract Markov chains (Q2322314) (← links)
- Bayesian statistical parameter synthesis for linear temporal properties of stochastic models (Q2324239) (← links)
- Probabilistic software product lines (Q2329442) (← links)
- Statistical verification of PCTL using antithetic and stratified samples (Q2335899) (← links)
- Read atomic transactions with prevention of lost updates: ROLA and its formal analysis (Q2335948) (← links)
- Towards light-weight probabilistic model checking (Q2336743) (← links)
- Bigraphs with sharing (Q2339468) (← links)
- Model checking single agent behaviours by fluid approximation (Q2346412) (← links)
- System design of stochastic models using robustness of temporal properties (Q2348023) (← links)
- Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools (Q2352775) (← links)
- Qualitative analysis of gene regulatory networks by temporal logic (Q2355694) (← links)
- Theorem proving graph grammars with attributes and negative application conditions (Q2358623) (← links)
- From LTL to deterministic automata. A safraless compositional approach (Q2363815) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← links)
- Limited by sensing -- a minimal stochastic model of the lag-phase during diauxic growth (Q2399590) (← links)
- Precisely deciding CSL formulas through approximate model checking for CTMCs (Q2402369) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- Precise parameter synthesis for stochastic biochemical systems (Q2407983) (← links)
- Error bounds for stochastic shortest path problems (Q2408892) (← links)
- Communicating by compatibility (Q2426519) (← links)
- Local abstraction refinement for probabilistic timed programs (Q2453108) (← links)
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes (Q2453111) (← links)
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms (Q2453112) (← links)
- Hybrid semantics for Bio-PEPA (Q2453221) (← links)
- On process rate semantics (Q2474433) (← links)
- Probabilistic model checking of complex biological pathways (Q2474435) (← links)
- Anonymity protocols as noisy channels (Q2482451) (← links)
