Verification and control of partially observable probabilistic systems

G Norman, D Parker, X Zou - Real-Time Systems, 2017 - Springer
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 …

Fault diagnosis using timed automata

P Bouyer, F Chevalier, D D'Souza - International Conference on …, 2005 - Springer
Fault diagnosis consists in observing behaviours of systems, and in detecting online
whether an error has occurred or not. In the context of discrete event systems this problem …

Controller synthesis for probabilistic systems

C Baier, M Größer, M Leucker, B Bollig… - Exploring New Frontiers …, 2004 - Springer
Controller synthesis addresses the question of how to limit the internal behavior of a given
implementation to meet its specification, regardless of the behavior enforced by the …

Alternating timed automata

S Lasota, I Walukiewicz - ACM Transactions on Computational Logic …, 2008 - dl.acm.org
A notion of alternating timed automata is proposed. It is shown that such automata with only
one clock have decidable emptiness problem over finite words. This gives a new class of …

The complexity of codiagnosability for discrete event and timed systems

F Cassez - IEEE Transactions on Automatic Control, 2012 - ieeexplore.ieee.org
In this paper, we study the fault codiagnosis problem for discrete event systems given by
finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform …

Qualitative analysis of partially-observable Markov decision processes

K Chatterjee, L Doyen, TA Henzinger - International Symposium on …, 2010 - Springer
We study observation-based strategies for partially-observable Markov decision processes
(POMDP s) with parity objectives. An observation-based strategy relies on partial information …

Folk theorems on the determinization and minimization of timed automata

S Tripakis - Information Processing Letters, 2006 - Elsevier
Timed automata are known not to be complementable or determinizable. Natural questions
are, then, could we check whether a given TA enjoys these properties? These problems are …

Real-time testing with timed automata testers and coverage criteria

M Krichen, S Tripakis - International Symposium on Formal Techniques in …, 2004 - Springer
In previous work, we have proposed a framework for black-box conformance testing of real-
time systems based on timed automata specifications and two types of tests: analog-clock or …

Timed control with observation based and stuttering invariant strategies

F Cassez, A David, KG Larsen, D Lime… - Automated Technology for …, 2007 - Springer
In this paper we consider the problem of controller synthesis for timed games under
imperfect information. Novel to our approach is the requirements to strategies: they should …

Requirements modelling by synthesis of deontic input-output automata

E Letier, W Heaven - 2013 35th International Conference on …, 2013 - ieeexplore.ieee.org
Requirements modelling helps software engineers understand a system's required
behaviour and explore alternative system designs. It also generates a formal software …