Bounded Model Checking for GSMP Models of Stochastic Real-Time Systems

  title={Bounded Model Checking for GSMP Models of Stochastic Real-Time Systems},
  author={Rajeev Alur and Mikhail Bernadsky},
Model checking is a popular algorithmic verification technique for checking temporal requirements of mathematical models of systems. In this paper, we consider the problem of verifying bounded reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMP). While GSMPs is a rich model for stochastic systems widely used in performance evaluation, existing model checking algorithms are applicable only to subclasses such as discrete-time or continuous… 

Symbolic Analysis for GSMP Models with One Stateful Clock

A symbolic solution for the case where firing times are random variables over a rich class of distributions, but only one event is allowed to retain its firing time when a discrete change occurs is presented.

Probabilistic Model Checking of Regenerative Concurrent Systems

The proposed solution is based on the analysis of regeneration points in model executions: a regeneration is encountered after a discrete event if the future evolution depends only on the current marking and not on its previous history, thus satisfying the Markov property.

Probabilistic Model Checking of Non-Markovian Models with Concurrent Generally Distributed Timers

Transient stochastic state classes can be used to perform bounded probabilistic model checking also for models with underlying GSMPs, and the conditions for termination of the resulting algorithm are characterized, both in exact and approximate evaluation.

Model Checking Probabilistic Timed Automata with One or Two Clocks

This work shows that PCTL probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless of how nondeterminism is resolved) are PTIME-complete for one clock Probabilistic timed automata, and are EXPTIME- complete for probabilism timed automATA with two clocks.

Behavioural Preorders on Stochastic Systems - Logical, Topological, and Computational Aspects

This work introduces a logical formalism for reasoning about upper and lower bounds on time, and studies the properties of this formalism, including axiomatisation and algorithms for checking when a formula is satisfied, and considers the question of when a system is faster than another system.

Analysing Decisive Stochastic Processes

This paper extends the concept of decisiveness to more general stochastic processes and obtains decidability results for both qualitative and quantitative verification problems on some classes of real-time stoChastic processes, including generalized semi-Markov processes and Stochastic timed automata.

On Zone-Based Analysis of Duration Probabilistic Automata

An extension of the zone-based forward reachability algorithm whose successor operator is a density transformer, thus providing a solution to verification and performance evaluation problems concerning acyclic DPA (or the bounded-horizon behavior of cyclic Dpa).

When are Stochastic Transition Systems Tameable?

Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes

This paper introduces Networks of Stochastic Timed Automata (NSTA), where the components interact with each other by message broadcasts, and characterize this general state space Markov process through transient stochastic state classes that sample the state and the absolute age after each event.

Hybrid Automata for Formal Modeling and Verification of Cyber-Physical Systems

A review of Hybrid automata as modeling and verification framework for cyber-physical systems, and some of the key results related to practical verification questions related to hybrid automata are surveyed.



Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)

This paper extends model-checking to stochastic real-time systems, whose behavior depends on probabilistic choice and quantitative time, with a model that can express constraints like “the delay between the request and the response is distributed uniformly between 2 to 4 seconds”.

Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach

A novel hybrid technique which combines aspects of symbolic and explicit approaches to overcome performance problems in probabilistic model checking, and achieves a dramatic improvement over the purely symbolic approach.

Verifying Quantitative Properties of Continuous Probabilistic Timed Automata

This work develops a model checking method for continuous probabilistic timed automata, which improves on the previously known techniques in that it allows the verification of quantitative probability bounds, as opposed to qualitative properties which can only refer to bounds of probability 0 or 1.

Model checking for probability and time: from theory to practice

  • M. Kwiatkowska
  • Computer Science
    18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
  • 2003
The experience with implementing PRISM, a probabilistic symbolic model checker, is reported, which demonstrates its usefulness in analyzing real-world probabilism protocols, and outlines future challenges for this research direction.

Model Checking

Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.

A Theory of Timed Automata

PRISM: Probabilistic Symbolic Model Checker

PRISM has been successfully used to analyse probabilistic termination, performance, and quality of service properties for a range of systems, including randomized distributed algorithms, manufacturing systems and workstation clusters.

The complexity of probabilistic verification

This work determines the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic and addresses questions for specifications described by ω-automata or formulas in extended temporal logic.

Automatic verification of probabilistic concurrent finite state programs

  • Moshe Y. Vardi
  • Computer Science
    26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
An automata-theoretic approach is described, whereby probabilistic quantification over sets of computations is reduced to standard quantificationover individual computations, and a new determinization construction for ω-automata is used to improve the time complexity of the algorithm by two exponentials.

Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling

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.