Automata, Languages, and Programming
40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II
Page
%P
118 Result(s)
-
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
Stochastic Analysis of Chemical Reaction Networks Using Linear Noise Approximation
Stochastic evolution of Chemical Reactions Networks (CRNs) over time is usually analysed through solving the Chemical Master Equation (CME) or performing extensive simulations. Analysing stochasticity is often...
-
Chapter and Conference Paper
Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks
Quantitative analysis of Markov models typically proceeds through numerical methods or simulation-based evaluation. Since the state space of the models can often be large, exact or approximate state aggregatio...
-
Chapter and Conference Paper
Synthesising Robust and Optimal Parameters for Cardiac Pacemakers Using Symbolic and Evolutionary Computation Techniques
We consider the problem of automatically finding safe and robust values of timing parameters of cardiac pacemaker models so that a quantitative objective, such as the pacemaker energy consumption or its cardia...
-
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...
-
Chapter and Conference Paper
On Quantitative Software Quality Assurance Methodologies for Cardiac Pacemakers
Embedded software is at the heart of implantable medical devices such as cardiac pacemakers, and rigorous software design methodologies are needed to ensure their safety and reliability. This paper gives an ov...
-
Chapter and Conference Paper
Invariant Verification of Nonlinear Hybrid Automata Networks of Cardiac Cells
Verification algorithms for networks of nonlinear hybrid automata (HA) can aid us understand and control biological processes such as cardiac arrhythmia, formation of memory, and genetic regulation. We present...
-
Chapter and Conference Paper
Compositional Controller Synthesis for Stochastic Games
Design of autonomous systems is facilitated by automatic synthesis of correct-by-construction controllers from formal models and specifications. We focus on stochastic games, which can model the interaction wi...
-
Chapter and Conference Paper
Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions
We propose a method to synthesise optimal values of timing parameters for probabilistic timed automata, in the sense that the probability of reaching some set of states is either maximised or minimised. Our fi...
-
Chapter and Conference Paper
Permissive Controller Synthesis for Probabilistic Systems
We propose novel controller synthesis techniques for probabilistic systems modelled using stochastic two-player games: one player acts as a controller, the second represents its environment, and probability is...
-
Chapter and Conference Paper
Verification of Markov Decision Processes Using Learning Algorithms
We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an ex...
-
Chapter and Conference Paper
Precise Parameter Synthesis for Stochastic Biochemical Systems
We consider the problem of synthesising rate parameters for stochastic biochemical networks so that a given time-bounded CSL property is guaranteed to hold, or, in the case of quantitative properties, the prob...
-
Article
From software verification to ‘everyware’ verification
Ubiquitous computing is a vision of computing in which the computer disappears from view and becomes embedded in our environment, in the equipment we use, in our clothes, and even in our body. Everyday objects...
-
Article
Preface to the special issue on Probabilistic Model Checking
-
Article
Automatic verification of competitive stochastic systems
We present automatic verification techniques for the modelling and analysis of probabilistic systems that incorporate competitive behaviour. These systems are modelled as turn-based stochastic multi-player gam...
-
Book and Conference Proceedings
-
Book and Conference Proceedings
Automata, Languages, and Programming
40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I
-
Chapter and Conference Paper
Incremental Runtime Verification of Probabilistic Systems
Probabilistic verification techniques have been proposed for runtime analysis of adaptive software systems, with the verification results being used to steer the system so that it satisfies certain Quality-of-...
-
Chapter and Conference Paper
PRISM-games: A Model Checker for Stochastic Multi-Player Games
We present PRISM-games, a model checker for stochastic multi-player games, which supports modelling, automated verification and strategy synthesis for probabilistic systems with competitive or cooperative beha...
-
Chapter and Conference Paper
Automated Verification and Strategy Synthesis for Probabilistic Systems
Probabilistic model checking is an automated technique to verify whether a probabilistic system, e.g., a distributed network protocol which can exhibit failures, satisfies a temporal logic property, for exampl...
