The following pages link to PRISM (Q13928):
Displaying 50 items.
- Analyzing Oscillatory Behavior with Formal Methods (Q2937728) (← links)
- A Tutorial on Interactive Markov Chains (Q2937729) (← links)
- On Abstraction of Probabilistic Systems (Q2937733) (← links)
- Synchronous Parallel Composition in a Process Calculus for Ecological Models (Q2938179) (← links)
- On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets (Q2941140) (← links)
- Permissive Controller Synthesis for Probabilistic Systems (Q2941765) (← links)
- Verification and Control of Partially Observable Probabilistic Real-Time Systems (Q2945599) (← links)
- Model-Checking Linear-Time Properties of Quantum Systems (Q2946731) (← links)
- Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains (Q2946750) (← links)
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems (Q2948229) (← links)
- ExplicitPRISMSymm: Symmetry Reduction Technique for Explicit Models in PRISM (Q2948486) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Applications of P Systems in Population Biology and Ecology: The Cases of MPP and APP Systems (Q2975901) (← links)
- Comparative Analysis of Statistical Model Checking Tools (Q2975907) (← links)
- On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context (Q2988377) (← links)
- Cognitive Reasoning and Trust in Human-Robot Interactions (Q2988805) (← links)
- Statistical Verification of Probabilistic Properties with Unbounded Until (Q2999315) (← links)
- Quantitative Multi-objective Verification for Probabilistic Systems (Q3000641) (← links)
- Efficient CTMC Model Checking of Linear Real-Time Objectives (Q3000642) (← links)
- QUASY: Quantitative Synthesis Tool (Q3000655) (← links)
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (Q3003315) (← links)
- Refining Dynamics of Gene Regulatory Networks in a Stochastic π-Calculus Framework (Q3003509) (← links)
- Automata-Based CSL Model Checking (Q3012926) (← links)
- A Progress Measure for Explicit-State Probabilistic Model-Checkers (Q3012927) (← links)
- On Stabilization in Herman’s Algorithm (Q3012941) (← links)
- Verification of Context-Dependent Channel-Based Service Models (Q3066118) (← links)
- The How and Why of Interactive Markov Chains (Q3066128) (← links)
- (Q3077200) (← links)
- Stochastic Model Checking (Q3084591) (← links)
- Verifying Team Formation Protocols with Probabilistic Model Checking (Q3092303) (← links)
- Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems (Q3092338) (← links)
- Performance Model Checking Scenario-Aware Dataflow (Q3172842) (← links)
- Hierarchical Counterexamples for Discrete-Time Markov Chains (Q3172933) (← links)
- Algorithm 972 (Q3176331) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms (Q3179391) (← links)
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers (Q3184684) (← links)
- Concavely-Priced Probabilistic Timed Automata (Q3184689) (← links)
- Towards Quantum Programs Verification: From Quipper Circuits to QPMC (Q3186602) (← links)
- Verifying Systems of Resource-Bounded Agents (Q3188235) (← links)
- Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions (Q3196339) (← links)
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops (Q3297595) (← links)
- Are Parametric Markov Chains Monotonic? (Q3297607) (← links)
- Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates (Q3297675) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- Optimal Translation of LTL to Limit Deterministic Automata (Q3303923) (← links)
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
- Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults (Q3303928) (← links)
- Maximizing the Conditional Expected Reward for Reaching the Goal (Q3303934) (← links)
