52 Result(s)
-
Chapter and Conference Paper
Concavely-Priced Probabilistic Timed Automata
Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavel...
-
Chapter and Conference Paper
Abstraction Refinement for Probabilistic Software
We present a methodology and implementation for verifying ANSI-C programs that exhibit probabilistic behaviour, such as failures or randomisation. We use abstraction-refinement techniques that represent probab...
-
Chapter and Conference Paper
Stochastic Games for Verification of Probabilistic Timed Automata
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 reacha...
-
Chapter
Stochastic Model Checking
This tutorial presents an overview of model checking for both discrete and continuous-time Markov chains (DTMCs and CTMCs). Model checking algorithms are given for verifying DTMCs and CTMCs against specificati...
-
Article
A formal analysis of bluetooth device discovery
This paper presents a formal analysis of the device discovery phase of the Bluetooth wireless communication protocol. The performance of this process is the result of a complex interaction between several devi...
-
Article
Performance analysis of probabilistic timed automata using digital clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a modelling formalism suitable for describing formally both nondeterministic and probabilistic asp...
-
Article
Numerical vs. statistical probabilistic model checking
Numerical analysis based on uniformisation and statistical techniques based on sampling and simulation are two distinct approaches for transient analysis of stochastic systems. We compare the two solution tech...
-
Chapter and Conference Paper
PRISM: A Tool for Automatic Verification of Probabilistic Systems
Probabilistic model checking is an automatic formal verification technique for analysing quantitative properties of systems which exhibit stochastic behaviour. PRISM is a probabilistic model checking tool whic...
-
Chapter and Conference Paper
Symmetry Reduction for Probabilistic Model Checking
We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stochastic characteristics. We targ...
-
Chapter and Conference Paper
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviours. This paper extends these r...
-
Article
Using probabilistic model checking for dynamic power management
Dynamic power management (DPM) refers to the use of runtime strategies in order to achieve a tradeoff between the performance and power consumption of a system and its components. We present an approach to ana...
-
Chapter and Conference Paper
Stochastic Transition Systems for Continuous State Spaces and Non-determinism
We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountable branching. Models of such systems hav...
-
Article
Probabilistic symbolic model checking with PRISM: a hybrid approach
In this paper we present efficient symbolic techniques for probabilistic model checking. These have been implemented in PRISM, a tool for the analysis of probabilistic models such as discrete-time Markov chain...
-
Article
Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time model checker Kronos and the probabilistic model ...
-
Chapter and Conference Paper
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterministic and probabilistic aspects ...
-
Chapter
Analysing Randomized Distributed Algorithms
Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, message routing and cache management. T...
-
Chapter and Conference Paper
Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study
Numerical analysis based on uniformisation and statistical techniques based on sampling and simulation are two distinct approaches for transient analysis of stochastic systems. We compare the two solution tech...
-
Chapter and Conference Paper
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are an extension of timed automata with discrete probability distributions, and can be used to model timed randomized protocols or fault-tolerant systems. We present symbolic model...
-
Article
Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol
The interplay of real time and probability is crucial to the correctness of the IEEE 1394 FireWire root contention protocol. We present a formal verification of the protocol using probabilistic model checking...
-
Chapter and Conference Paper
Analysis of Probabilistic Contract Signing
We consider the probabilistic contract signing protocol of Ben-Or, Goldreich, Micali, and Rivest as a case study in formal verification of probabilistic security protocols. Using the probabilistic model checke...
