The following pages link to PRISM (Q13928):
Displaying 50 items.
- Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains (Q3400550) (← links)
- (Q3416073) (← links)
- Analysis of Probabilistic Systems via Generating Functions and Padé Approximation (Q3449467) (← links)
- The Complexity of Synthesis from Probabilistic Components (Q3449469) (← links)
- Fast Debugging of PRISM Models (Q3457786) (← links)
- Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata (Q3457793) (← links)
- Marimba: A Tool for Verifying Properties of Hidden Markov Models (Q3460559) (← links)
- ASSA-PBN: An Approximate Steady-State Analyser of Probabilistic Boolean Networks (Q3460562) (← links)
- Validation of Decentralised Smart Contracts Through Game Theory and Formal Methods (Q3460868) (← links)
- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking (Q3510805) (← links)
- Abstraction of Probabilistic Systems (Q3510828) (← links)
- Quantitative Model Checking Revisited: Neither Decidable Nor Approximable (Q3510843) (← links)
- Extended Directed Search for Probabilistic Timed Reachability (Q3511221) (← links)
- (Q3519383) (← links)
- Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives (Q3522889) (← links)
- Verification of Expectation Properties for Discrete Random Variables in HOL (Q3523170) (← links)
- Proving Positive Almost Sure Termination Under Strategies (Q3527308) (← links)
- State-Aware Performance Analysis with eXtended Stochastic Probes (Q3543312) (← links)
- Concurrency and Composition in a Stochastic World (Q3584919) (← links)
- Behavioral Cartography of Timed Automata (Q3584962) (← links)
- A Framework for Verification of Software with Time and Probabilities (Q3588082) (← links)
- Abstraction Refinement for Probabilistic Software (Q3600474) (← links)
- Temporalization of Probabilistic Propositional Logic (Q3605519) (← links)
- Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms (Q3612925) (← links)
- Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus (Q3613062) (← links)
- Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata (Q3614855) (← links)
- Bio-PEPA with Events (Q3642952) (← links)
- Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back (Q3642958) (← links)
- Algebra and logic for resource-based systems modelling (Q3643362) (← links)
- Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates (Q3646252) (← links)
- Statistical Model Checking Using Perfect Simulation (Q3648695) (← links)
- (Q4422079) (← links)
- (Q4551150) (← links)
- Complexity Results for Probabilistic Datalog (Q4576254) (← links)
- Formal System Verification (Q4610434) (← links)
- Two-stage agent program verification (Q4612415) (← links)
- Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs (Q4620274) (← links)
- RDA: A Coq Library to Reason about Randomised Distributed Algorithms in the Message Passing Model (Q4621204) (← links)
- Limit-Deterministic Büchi Automata for Linear Temporal Logic (Q4633559) (← links)
- Quantitative Automata under Probabilistic Semantics (Q4635863) (← links)
- Rabinizer: Small Deterministic Automata for LTL(F,G) (Q4649288) (← links)
- Variable Probabilistic Abstraction Refinement (Q4649305) (← links)
- Pareto Curves for Probabilistic Model Checking (Q4649306) (← links)
- Reaching consensus on a connected graph (Q4684846) (← links)
- (Q4738769) (← links)
- (Q4813198) (← links)
- (Q4813202) (← links)
- (Q4813204) (← links)
- (Q4813205) (← links)
- Trend-Based Analysis of a Population Model of the AKAP Scaffold Protein (Q4912376) (← links)
