On Zone-Based Analysis of Duration Probabilistic Automata

@inproceedings{Maler2010OnZA,
  title={On Zone-Based Analysis of Duration Probabilistic Automata},
  author={Oded Maler and Kim Guldstrand Larsen and Bruce H. Krogh},
  booktitle={Infinity},
  year={2010}
}
We propose an extension of the zone-based algorithmics for analyzing timed automata to handle systems where timing uncertainty is considered as probabilistic rather than set-theoretic. We study duration probabilistic automata (DPA), expressing multiple parallel processes admitting memoryfull continuously-distributed durations. For this model we develop an extension of the zone-based forward reachability algorithm whose successor operator is a density transformer, thus providing a solution to… 

Figures from this paper

Importance Sampling for Stochastic Timed Automata

This work presents an importance sampling framework that combines symbolic analysis and simulation to estimate the probability of rare reachability properties in stochastic timed automata by means of symbolic exploration and a state-wise change of measure during simulations.

As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty

This paper develops a dynamic-programming style procedure for automatically synthesizing (or approximating) expected time optimal schedulers, using an iterative computation of a stochastic time-to-go function over the state and clock space of the automaton.

Model checking for probabilistic timed automata

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”.

Aalborg Universitet Importance Sampling for Stochastic Timed Automata

This work presents an importance sampling framework that combines symbolic analysis and simulation to estimate the probability of rare reachability properties in stochastic timed automata by means of symbolic exploration and a state-wise change of measure during simulations.

Statistical Model Checking for Networks of Priced Timed Automata

The semantics provides the basis for satisfaction of probabilistic Weighted CTL properties (PWCTL), conservatively extending the classical satisfaction of timed automata with respect to TCTL, and offers an extension that allows to efficiently compare performance properties of NPTAs in a parametric setting.

Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems

A number of results on associated decision problems related to model checking, equivalence checking, optimal scheduling, the existence of winning strategies, and then statistical model checking are highlighted.

Duration Probabilistic Automata

It is shown how DPAs can be translated to other formalisms and how statistical modelchecking can be applied and the Uppaal translation is found viable for verifying DPAs that consist of 55 sequences of tasks with 55 tasks each.

Relating average and discounted costs for quantitative analysis of timed systems

  • R. AlurAshutosh Trivedi
  • Computer Science, Mathematics
    2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT)
  • 2011
These results answer an open question posed by Fahrenberg and Larsen, and give simpler proofs of some known decidability results on (probabilistic) timed automata.

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.

UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata

A survey of U PPAAL-SMC, a major extension of the real-time verification tool UPPAAL, including modeling and specification formalisms as well as techniques applied with applications of the tool to case studies.

References

SHOWING 1-10 OF 29 REFERENCES

On Interleaving in Timed Automata

This work proves the following quite surprising result: the union of all zones reached by different interleavings of the same set of transitions is convex, and can improve the standard reachability computation for timed automata by merging such zones whenever they are encountered.

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”.

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.

Automatic verification of real-time systems with discrete probability distributions

Using Stochastic State Classes in Quantitative Evaluation of Dense-Time Reactive Systems

This work extends time Petri nets by associating a probability density-function to the static firing interval of each nondeterministic transition and explains how this stochastic information induces a probability distribution for the states contained within a DBM class.

Model Checking Probabilistic Real Time Systems

A formal model of probabilistic real time systems as an extension of traditional nite labelled transition graphs with dense time and probabilities and also a model checking method for veriication with respect to the logic is presented.

Introducing probability within state class analysis of dense-time-dependent systems

The concept of equivalence classes based on DBM encoding with a density function which provides a measure for the probability associated with individual states collected in the class itself is extended and opens the way to characterizing the possibility of critical behaviors with a quantitative measure of probability.

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

It is shown that the probability density function for the remaining firing times of different events in a GSMP after k discrete events can be effectively partitioned into finitely many regions and represented by exponentials and polynomials.

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.

Scheduling with timed automata