PRISM - MaRDI portal

Cited in

(only showing first 100 items - show all)

Non-deterministic Weighted Automata on Random Words
Fast debugging of PRISM models
Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
A survey of timed automata for the development of real-time systems
High-level counterexamples for probabilistic automata
State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
Fair termination for parameterized probabilistic concurrent systems
Three-valued abstraction for probabilistic systems
Optimal cost almost-sure reachability in POMDPs
\(L^\ast\)-based learning of Markov decision processes (extended version)
Counterexample-guided inductive synthesis for probabilistic systems
Quantitative verification of Kalman filters
Theoretical Aspects of Computing – ICTAC 2005
Bio-PEPA: A framework for the modelling and analysis of biological systems
Stochastic graph transformation systems
Multiphase until formulas over Markov reward models: an algebraic approach
Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
Model-based verification, optimization, synthesis and performance evaluation of real-time systems
Reflections on the future of concurrency theory in general and process calculi in particular
Quo vadis explicit-state model checking
Relating PDEs in cylindrical coordinates and CTMCs with levels of concentration
scientific article; zbMATH DE number 7455747 (Why is no real title available?)
Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions
Probabilistic model checking for energy-utility analysis
Minimal counterexamples for linear-time probabilistic verification
Abstraction Refinement for Probabilistic Software
Formal Analysis of Memory Contention in a Multiprocessor System
Infinite probability computation by cyclic explanation graphs
A formal verification technique for behavioural model-to-model transformations
Model-based testing of probabilistic systems
K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Reachability Switching Games
A framework for verification of software with time and probabilities
Smoothed model checking for uncertain continuous-time Markov chains
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
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
Of cores: a partial-exploration framework for Markov decision processes
Layered reasoning for randomized distributed algorithms
Parameter and Controller Synthesis for Markov Chains with Actions and State Labels.
Lifted model checking for relational MDPs
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
Abstraction-guided truncations for stationary distributions of Markov population models
Formal abstraction and synthesis of parametric stochastic processes
Lumpability for uncertain continuous-time Markov chains
Model checking \(\omega \)-regular properties with decoupled search
Model checking finite-horizon Markov chains with probabilistic inference
Model-free reinforcement learning for branching Markov decision processes
Tweaking the odds in probabilistic timed automata
The how and why of interactive Markov chains
Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
Symbolic computation of differential equivalences
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Probabilistic software product lines
Computer Aided Verification
EthVer: formal verification of randomized Ethereum smart contracts
Analyzing oscillatory behavior with formal methods
Two-stage agent program verification
Types and typechecking for Communicating Quantum Processes
Deep statistical model checking
Translating stochastic CLS into Maude
PuRSUE -- from specification of robotic environments to synthesis of controllers
scientific article; zbMATH DE number 7566069 (Why is no real title available?)
Combined model checking for temporal, probabilistic, and real-time logics
Verification and control for probabilistic hybrid automata with finite bisimulations
Cost preserving bisimulations for probabilistic automata
Model checking usage policies
Probabilistic verification of Herman's self-stabilisation algorithm
Multiple verification in complex biological systems: the bone remodelling case study
The complexity of reachability in parametric 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
Multi-scale verification of distributed synchronisation
Reachability in recursive Markov decision processes
What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
Value iteration for long-run average reward in Markov decision processes
A Unified Translation of Linear Temporal Logic to ω-Automata
Read atomic transactions with prevention of lost updates: ROLA and its formal analysis
Spatial calculus of looping sequences
Observing branching structure through probabilistic contexts
Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs
Model Checking-Based Genetic Programming with an Application to Mutual Exclusion
A static analysis framework for livelock freedom in CSP
Verifying team formation protocols with probabilistic model checking
Abstraction of Probabilistic Systems
Computing cumulative rewards using fast adaptive uniformization
On-the-fly fast mean-field model-checking
Modular modelling of signalling pathways and their cross-talk
A state-based model of sensor protocols
Space-efficient scheduling of stochastically generated tasks
Variable probabilistic abstraction refinement
DNA walker circuits: computational potential, design, and verification
Theoretical Aspects of Computing - ICTAC 2004
Interval probabilistic timed graph transformation systems
On Abstraction of Probabilistic Systems
Model-checking linear-time properties of quantum systems
Trend-based analysis of a population model of the AKAP scaffold protein
A Tool for the Automated Verification of Nash Equilibria in Concurrent Games

This page was built for software: PRISM