Quantitative Evaluation of Systems
11th International Conference, QEST 2014, Florence, Italy, September 8-10, 2014. Proceedings
Page
%P
52 Result(s)
-
Chapter
Probabilistic Model Checking: Advances and Applications
Probabilistic model checking is a powerful technique for formally verifying quantitative properties of systems that exhibit stochastic behaviour. Such systems are found in many application domains: for example...
-
Open Access This content is freely available online to anyone, anywhere at any time.
Article
Verification and control of partially observable probabilistic systems
We present automated techniques for the verification and control of partially observable, probabilistic systems for both discrete and dense models of time. For the discrete-time case, we formally model these s...
-
Chapter and Conference Paper
Autonomous Agent Behaviour Modelled in PRISM – A Case Study
Formal verification of agents representing robot behaviour is a growing area due to the demand that autonomous systems have to be proven safe. In this paper we present an abstract definition of autonomy which ...
-
Chapter and Conference Paper
Mathematical Modelling of Trust Issues in Federated Identity Management
With the absence of physical evidence, the concept of trust plays a crucial role in the proliferation and popularisation of online services. In fact, trust is the inherent quality that binds together all invol...
-
Chapter and Conference Paper
Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata
In this paper we consider the problem of computing the minimum expected time to reach a target and the synthesis of the corresponding optimal controller for a probabilistic timed automaton (PTA). Although this...
-
Chapter and Conference Paper
Verification and Control of Partially Observable Probabilistic Real-Time Systems
We propose automated techniques for the verification and control of probabilistic real-time systems that are only partially observable. To formally model such systems, we define an extension of probabilistic t...
-
Book and Conference Proceedings
-
Chapter
Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations
This paper concerns labelled Markov processes (LMPs), probabilistic models over uncountable state spaces originally introduced by Prakash Panangaden and colleagues. Motivated by the practical application of th...
-
Article
Analysis of stochastic matching markets
Suppose that the agents of a matching market contact each other randomly and form new pairs if is in their interest. Does such a process always converge to a stable matching if one exists? If so, how quickly? ...
-
Article
Model checking for probabilistic timed automata
Probabilistic timed automata (PTAs) are a formalism for modelling systems whose behaviour incorporates both probabilistic and real-time characteristics. Applications include wireless communication protocols, a...
-
Article
Probabilistic verification of Herman’s self-stabilisation algorithm
Herman’s self-stabilisation algorithm provides a simple randomised solution to the problem of recovering from faults in an N-process token ring. However, a precise analysis of the algorithm’s maximum execution ti...
-
Chapter and Conference Paper
PRISM 4.0: Verification of Probabilistic Real-Time Systems
This paper describes a major new release of the PRISM probabilistic model checker, adding, in particular, quantitative verification of (priced) probabilistic timed automata. These model systems exhibiting probabi...
-
Chapter and Conference Paper
Quantitative Multi-objective Verification for Probabilistic Systems
We present a verification framework for analysing multiple quantitative objectives of systems that exhibit both nondeterministic and stochastic behaviour. These systems are modelled as probabilistic automata, ...
-
Chapter
Automated Verification Techniques for Probabilistic Systems
This tutorial provides an introduction to probabilistic model checking, a technique for automatically verifying quantitative properties of probabilistic systems. We focus on Markov decision processes (MDPs), w...
-
Article
A game-based abstraction-refinement framework for Markov decision processes
In the field of model checking, abstraction refinement has proved to be an extremely successful methodology for combating the state-space explosion problem. However, little practical progress has been made in ...
-
Chapter and Conference Paper
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respectively, the expected time to ...
-
Chapter and Conference Paper
Assume-Guarantee Verification for Probabilistic Systems
We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to verification, where both the assumptions m...
-
Chapter and Conference Paper
A Framework for Verification of Software with Time and Probabilities
Quantitative verification techniques are able to establish system properties such as “the probability of an airbag failing to deploy on demand” or “the expected time for a network protocol to successfully send...
-
Chapter
Quantitative Verification Techniques for Biological Processes
Probabilistic model checking is a formal verification framework for systems which exhibit stochastic behavior. It has been successfully applied to a wide range of domains, including security and communication ...
-
Chapter and Conference Paper
Bisimulation for Demonic Schedulers
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the process and collaborates wit...
