PRISM

swMATH1186MaRDI QIDQ13928FDOQ13928

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Stochastic graph transformation systems
• \(L^\ast\)-based learning of Markov decision processes (extended version)
• Counterexample-guided inductive synthesis for probabilistic systems
• Quantitative verification of Kalman filters
• Lifted model checking for relational MDPs
• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints
• Simple Strategies in Multi-Objective MDPs
• Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes
• Model checking for entanglement swapping
• Zone-based verification of timed automata: extrapolations, simulations and what next?
• Towards light-weight probabilistic model checking
• Title not available (Why is that?)
• Value iteration for long-run average reward in Markov decision processes
• Verifying team formation protocols with probabilistic model checking
• DNA walker circuits: computational potential, design, and verification
• Interval probabilistic timed graph transformation systems
• Non-deterministic weighted automata evaluated over Markov chains
• Quantitative static analysis of communication protocols using abstract Markov chains
• A counter abstraction technique for verifying properties of probabilistic swarm systems
• Learning infinite-word automata with loop-index queries
• A modal logic for mixed strategies
• Statistical verification of PCTL using antithetic and stratified samples
• Statistical model checking of stochastic component-based systems
• Back to the future: a fresh look at linear temporal logic
• Fast Debugging of PRISM Models
• Automated formal analysis and verification: an overview
• An inductive technique for parameterised model checking of degenerative distributed randomised protocols
• On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets
• Analysis of Probabilistic Systems via Generating Functions and Padé Approximation
• Solving systems of bilinear equations for transition rate reconstruction
• Trust evidence logic
• Determinization and limit-determinization of Emerson-Lei automata
• Automatic verification of concurrent stochastic systems
• Verified analysis of random binary tree structures
• Computing branching distances with quantitative games
• Multi-cost bounded tradeoff analysis in MDP
• \(\mathrm{MDP + TA = PTA}\): probabilistic timed automata, formalized (short paper)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computation tree measurement language (CTML)
• An AGM-style belief revision mechanism for probabilistic spatio-temporal logics
• High-level Counterexamples for Probabilistic Automata
• Model Checking Security Protocols
• Statistical verification of probabilistic properties with unbounded until
• A formal approach to adaptive software: continuous assurance of non-functional requirements
• Reconciling real and stochastic time: the need for probabilistic refinement
• Model Checking Kernel P Systems
• Variable Probabilistic Abstraction Refinement
• Exact quantitative probabilistic model checking through rational search
• A refinement-based development of a distributed signalling system
• Enhancing probabilistic model checking with ontologies
• Faster statistical model checking for unbounded temporal properties
• Are Parametric Markov Chains Monotonic?
• Sequential Convex Programming for the Efficient Verification of Parametric MDPs
• Moment-based analysis of Bayesian network properties
• Computing Cumulative Rewards Using Fast Adaptive Uniformization
• Efficient CTMC Model Checking of Linear Real-Time Objectives
• Communicating by compatibility
• Refinement and difference for probabilistic automata
• Tools and Algorithms for the Construction and Analysis of Systems
• Comparative Analysis of Statistical Model Checking Tools
• A survey of timed automata for the development of real-time systems
• Three-valued abstraction for probabilistic systems
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Minimal counterexamples for linear-time probabilistic verification
• K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
• 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
• Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
• Layered reasoning for randomized distributed algorithms
• Probabilistic approximations of ODEs based bio-pathway dynamics
• Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement
• Model checking usage policies
• Probabilistic verification of Herman's self-stabilisation algorithm
• The complexity of reachability in parametric Markov decision processes
• Combined model checking for temporal, probabilistic, and real-time logics
• Model Checking-Based Genetic Programming with an Application to Mutual Exclusion
• Reachability in recursive Markov decision processes
• Space-efficient scheduling of stochastically generated tasks
• Approximate Verification of the Symbolic Dynamics of Markov Chains
• Property specifications for workflow modelling
• Performance analysis and functional verification of the stop-and-wait protocol in HOL
• A probabilistic extension of UML statecharts specification and verification
• Computer aided verification. 13th international conference, CAV 2001, Paris, France, July 18--22, 2001. Proceedings
• Measuring the confinement of probabilistic systems
• Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
• Stochastic model checking
• A probabilistic model for molecular systems
• Validation of Stochastic Systems
• On stabilization in Herman's algorithm
• Hierarchical counterexamples for discrete-time Markov chains
• Magnifying-Lens Abstraction for Markov Decision Processes
• Three tokens in Herman's algorithm
• An algebraic method to fidelity-based model checking over quantum Markov chains
• Bayesian statistical model checking with application to Stateflow/Simulink verification
• On-the-fly Fast Mean-Field Model-Checking
• Simplifying Itai-Rodeh leader election for anonymous rings
• Using probabilistic Kleene algebra pKA for protocol verification
• Anonymity protocols as noisy channels
• Verification and Control of Partially Observable Probabilistic Real-Time Systems

This page was built for software: PRISM