The following pages link to PRISM (Q13928):
Displaying 50 items.
- Abstract model repair for probabilistic systems (Q1706149) (← links)
- Formal verification and quantitative metrics of MPSoC data dynamics (Q1707342) (← links)
- Modeling fimbriae mediated parasite-host interactions (Q1719914) (← links)
- Verification and control for probabilistic hybrid automata with finite bisimulations (Q1734511) (← links)
- A state-based model of sensor protocols (Q1758154) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Model checking Markov population models by stochastic approximations (Q1784959) (← links)
- Data-driven modelling and probabilistic analysis of interactive software usage (Q1785866) (← links)
- Reachability in parametric interval Markov chains using constraints (Q1786613) (← links)
- \(\mathrm{MDP + TA = PTA}\): probabilistic timed automata, formalized (short paper) (Q1791206) (← links)
- Computation tree measurement language (CTML) (Q1798671) (← links)
- Model checking and abstraction to the aid of parameterized systems (a survey) (Q1886449) (← links)
- Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models (Q1886599) (← links)
- Tools and algorithms for the construction and analysis of systems. 19th international conference, TACAS 2013, held as part of the European joint conferences on theory and practice of software, ETAPS 2013, Rome, Italy, March 16--24, 2013. Proceedings (Q1935964) (← links)
- A formal approach to adaptive software: continuous assurance of non-functional requirements (Q1941849) (← links)
- Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions (Q1941851) (← links)
- Layered reasoning for randomized distributed algorithms (Q1941864) (← links)
- Reconciling real and stochastic time: the need for probabilistic refinement (Q1941867) (← links)
- Probabilistic verification of Herman's self-stabilisation algorithm (Q1941879) (← links)
- Three tokens in Herman's algorithm (Q1941880) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- Counterexample-guided inductive synthesis for probabilistic systems (Q1982641) (← links)
- Quantitative verification of Kalman filters (Q1982642) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- DNA walker circuits: computational potential, design, and verification (Q2003463) (← links)
- Probabilistic black-box reachability checking (extended version) (Q2008284) (← links)
- Non-deterministic weighted automata evaluated over Markov chains (Q2009651) (← links)
- A modal logic for mixed strategies (Q2016081) (← links)
- Lagrangian approximations for stochastic reachability of a target tube (Q2021292) (← links)
- A probabilistic calculus of cyber-physical systems (Q2042728) (← links)
- Enhancing probabilistic model checking with ontologies (Q2065528) (← links)
- A refinement-based development of a distributed signalling system (Q2065545) (← links)
- A tale of two graph models: a case study in wireless sensor networks (Q2065559) (← links)
- Moment-based analysis of Bayesian network properties (Q2072070) (← links)
- An algebraic method to fidelity-based model checking over quantum Markov chains (Q2084946) (← links)
- Automated verification and synthesis of stochastic hybrid systems: a survey (Q2097770) (← links)
- Lifted model checking for relational MDPs (Q2102421) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Model checking for entanglement swapping (Q2112108) (← links)
- Interval probabilistic timed graph transformation systems (Q2117267) (← links)
- Back to the future: a fresh look at linear temporal logic (Q2117656) (← links)
- A counter abstraction technique for verifying properties of probabilistic swarm systems (Q2124442) (← links)
- Learning infinite-word automata with loop-index queries (Q2124472) (← links)
- Solving systems of bilinear equations for transition rate reconstruction (Q2145274) (← links)
- Trust evidence logic (Q2146059) (← links)
- Determinization and limit-determinization of Emerson-Lei automata (Q2147175) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- Value iteration for long-run average reward in Markov decision processes (Q2151247) (← links)
- Gradient-descent for randomized controllers under partial observability (Q2152644) (← links)
- Out of control: reducing probabilistic models by control-state elimination (Q2152665) (← links)
