Symbolic Model Checking for Probabilistic Timed Automata

Kwiatkowska, Marta; Norman, Gethin; Sproston, Jeremy; Wang, Fuzhi

doi:10.1007/978-3-540-30206-3_21

Cited by 65 publications

(102 citation statements)

References 33 publications

Supporting

Mentioning

102

Contrasting

Order By: Relevance

“…Full details of all these case studies, their parameters, and the properties checked are available. We present a comparison of our implementation with the two other existing techniques for reachability analysis of PTAs: backwards reachability [17] and digital clocks [15]. For the former, we use the implementation of [17] which uses PRISM as a back-end to analyse MDP.…”

Section: Resultsmentioning

confidence: 99%

“…There are three main existing algorithmic approaches to the verification of PTAs: (i) forwards reachability [16,5]; (ii) backwards reachability [17]; and (iii) digital clocks [15]. Forwards reachability is based on a symbolic forwards exploration, similar to the techniques implemented in state-of-the art tools for nonprobabilistic timed automata [6,18].…”

Section: Introductionmentioning

confidence: 99%

“…Backwards reachability [17] performs a state-space exploration in the opposite direction, from target to initial states. This computes exact values for both minimum and maximum reachability probabilities; however, the operations required to implement it are expensive, limiting its applicability.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Stochastic Games for Verification of Probabilistic Timed Automata

Kwiatkowska

Norman

Parker

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic timed automata, forwards reachability is the analysis method of choice, since it can be implemented extremely efficiently. However, for PTAs, such techniques are only able to compute upper bounds on maximum reachability probabilities. In this paper, we propose a new approach to the analysis of PTAs using abstraction and stochastic games. We show how efficient forwards reachability techniques can be extended to yield both lower and upper bounds on maximum (and minimum) reachability probabilities. We also present abstraction-refinement techniques that are guaranteed to improve the precision of these probability bounds, providing a fully automatic method for computing the exact values. We have implemented these techniques and applied them to a set of large case studies. We show that, in comparison to alternative approaches to verifying PTAs, such as backwards reachability and digital clocks, our techniques exhibit superior performance and scalability.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Stochastic Games for Verification of Probabilistic Timed Automata

Kwiatkowska

Norman

Parker

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…PTAs naturally model distributed randomised algorithms with timing, for example the ZeroConf protocol, as well as the medium access protocols for wireless networks, including WiFi, Bluetooth and ZigBee; all have been analysed with PRISM [1]. A number of techniques have been developed for quantitative verification of PTAs, including the digital clocks [36] approach; forwards [37] and backwards reachability [38] based on zones; and game-based quantitative abstraction-refinement [33]. Strategy synthesis is also possible [44].…”

Section: Further Advancesmentioning

confidence: 99%

Advances in Quantitative Verification for Ubiquitous Computing

Kwiatkowska

2013

Theoretical Aspects of Computing – ICTAC 2013

Self Cite

View full text Add to dashboard Cite

Abstract. Ubiquitous computing, where computers 'disappear' and instead sensor-enabled and software-controlled devices assist us in everyday tasks, has become an established trend. To ensure the safety and reliability of software embedded in these devices, rigorous model-based design methodologies are called for. Quantitative verification, a powerful technique for analysing system models against quantitative properties such as "the probability of a data packet being delivered within 1ms to a nearby Bluetooth device is at least 0.98", has proved useful by detecting and correcting flaws in a number of ubiquitous computing applications. In this paper, we focus on three key aspects of ubiquitous computing: autonomous behaviour, constrained resources and adaptiveness. We summarise recent advances of quantitative verification in relation to these aspects, illustrating each with a case study analysed using the probabilistic model checker PRISM. The paper concludes with an outline of future challenges that remain in this area.

show abstract

“…This approach requires that the comparisons involving clocks in guards and invariants are non-strict; however, this is a common property in PTA models of real-life systems, such as the CSMA/CD protocol considered in this chapter. The digital-clocks approach has been, to date, the most successful in practice of the finite-state representations proposed for PTAs: it has been used to verify the CSMA/CD protocol [10,28], part of the IEEE 802.11 standard for wireless local area networks [26,31], the FireWire root contention protocol [27], and the IPv4 Zeroconf protocol [23].…”

Section: Outlinementioning

confidence: 99%