PRISM 4.0: Verification of Probabilistic Real-Time Systems

@inproceedings{Kwiatkowska2011PRISM4V,
  title={PRISM 4.0: Verification of Probabilistic Real-Time Systems},
  author={M. Kwiatkowska and Gethin Norman and D. Parker},
  booktitle={CAV},
  year={2011}
}
This paper describes a major new release of the PRISMprobabilistic model checker, adding, in particular, quantitative verification of (priced) probabilistic timed automata. These model systems exhibiting probabilistic, nondeterministic and real-time characteristics. In many application domains, all three aspects are essential; this includes, for example, embedded controllers in automotive or avionic systems, wireless communication protocols such as Bluetooth or Zigbee, and randomised security… 
Verification of Probabilistic Real-time Systems
TLDR
The model of probabilistic timed automata (PTAs) is described, which can be used to represent systems with both Probabilistic and real-time characteristics, and how to formally specify quantitative properties of PTAs is illustrated.
Verification and Control of Turn-Based Probabilistic Real-Time Games
TLDR
This work shows how to compute the key measures that underlie quantitative verification, namely the probability and expected cumulative price to reach a target, for the model of turn-based probabilistic timed multi-player games.
University of Birmingham Verification and control of turn-based probabilistic real-time games
TLDR
This work shows how to compute the key measures that underlie quantitative verification, namely the probability and expected cumulative price to reach a target, for the model of turn-based probabilistic timed multi-player games.
Reachability Verification of Probabilistic Linear Hybrid Automata
TLDR
Probabilistic linear hybrid automata (PLHAs) are defined, which are superclass of PPTAs, which has real-valued variables proportional to time and discrete probabilistic distributions and the verification program enables automatic verification for the such model.
Probabilistic model checking: advances and applications
TLDR
This chapter starts with an introduction to the technique of probabilistic model checking, then surveys some recent advances in the area, including controller synthesis, compositional verification, Probabilistic real-time systems and parametric model checking.
Model checking for probabilistic timed automata
TLDR
This paper gives an introduction to PTAs and describes techniques for analysing a wide range of quantitative properties, such as “ the maximum probability of the airbag failing to deploy within 0.02 seconds”, “the maximum expected time for the protocol to terminate” or ”the minimum expected energy consumption required to complete all tasks”.
Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata
TLDR
This paper proposes symbolic techniques for verification and optimal strategy synthesis for priced probabilistic timed automata which avoid this discretisation of real-valued clocks.
Model-based testing of stochastically timed systems
TLDR
This paper presents two model-based testing frameworks that additionally cover the stochastic aspects in hard and soft real-time systems and highlights the trade-off of simple and efficient statistical evaluation for Markov automata versus precise and realistic modelling with Stochastic automata.
A Model Checker for Hierarchical Probabilistic Real-Time Systems
TLDR
This work presents a model checker to analyze hierarchical probabilistic real-time systems using PRTS, and has implemented PRTS in model checking framework PAT so that friendly user interface can be used to edit, simulate and verify PRTS models.
PRTS: An Approach for Model Checking Probabilistic Real-Time Hierarchical Systems
TLDR
An automated approach for verifying probabilistic, real-time, hierarchical systems, and a zone-based method is used to build a finite-state abstraction of PRTS models so that Probabilistic model checking could be used to calculate the probability of a system satisfying certain property.
...
...

References

SHOWING 1-10 OF 16 REFERENCES
Automatic verification of real-time systems with discrete probability distributions
Abstraction Refinement for Probabilistic Software
TLDR
This work uses abstraction-refinement techniques that represent probabilistic programs as Markov decision processes and their abstractions as stochastic two-player games to verify ANSI-C programs that exhibit probabilism behaviour, such as failures or randomisation.
A Modest Approach to Checking Probabilistic Timed Automata
  • A. Hartmanns, H. Hermanns
  • Computer Science
    2009 Sixth International Conference on the Quantitative Evaluation of Systems
  • 2009
TLDR
This paper presents a fully automatic tool for model checking PTA with respect to probabilistic and expected reachability properties, using an integral semantics of time, representing clocks with bounded integer variables in Modest.
Stochastic Games for Verification of Probabilistic Timed Automata
TLDR
This paper shows how efficient forwards reachability techniques can be extended to yield both lower and upper bounds on maximum (and minimum) reachability probabilities, and presents abstraction-refinement techniques that are guaranteed to improve the precision of these probability bounds, providing a fully automatic method for computing the exact values.
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
TLDR
This paper shall semi-formally introduce these time dependant models, discuss their strengths and weaknesses, and provide an overview of the known results about the relationships among the models.
Approximate Probabilistic Model Checking
TLDR
An approximation method to verify quantitative properties on discrete Markov chains using a randomized algorithm to approximate the probability that a property expressed by some positive LTL formula is satisfied with high confidence by a probabilistic system.
The Ins and Outs of the Probabilistic Model Checker MRMC
Probabilistic model checking of complex biological pathways
A game-based abstraction-refinement framework for Markov decision processes
TLDR
A novel abstraction-refinement framework for Markov decision processes (MDPs), which are widely used for modelling and verifying systems that exhibit both probabilistic and nondeterministic behaviour, is presented.
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
TLDR
A model independent procedure for verifying properties of discrete event systems based on Monte Carlo simulation and statistical hypothesis testing that is probabilistic in two senses and carried out in an anytime manner.
...
...