English
Related papers

Related papers: Verification and Control of Partially Observable P…

200 papers

Design and control of autonomous systems that operate in uncertain or adversarial environments can be facilitated by formal modelling and analysis. Probabilistic model checking is a technique to automatically verify, for a given temporal…

Logic in Computer Science · Computer Science 2021-11-23 Marta Kwiatkowska , Gethin Norman , David Parker

This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational (i.e., automata-based) and descriptive (i.e., logic-based)…

Logic in Computer Science · Computer Science 2013-08-14 Carlo A. Furia , Matteo Pradella , Matteo Rossi

We consider the synthesis of control policies for probabilistic systems, modeled by Markov decision processes, operating in partially known environments with temporal logic specifications. The environment is modeled by a set of Markov…

Logic in Computer Science · Computer Science 2012-03-07 Tichakorn Wongpiromsarn , Emilio Frazzoli

This paper presents a new approach to Model Predictive Control for environments where essential, discrete variables are partially observed. Under this assumption, the belief state is a probability distribution over a finite number of…

Robotics · Computer Science 2023-02-02 Camille Phiquepal , Marc Toussaint

This work proposes a decision-making framework for partially observable systems in continuous time with discrete state and action spaces. As optimal decision-making becomes intractable for large state spaces we employ approximation methods…

Machine Learning · Computer Science 2024-03-01 Yannick Eich , Bastian Alt , Heinz Koeppl

A fundamental concept in control theory is that of controllability, where any system state can be reached through an appropriate choice of control inputs. Indeed, a large body of classical and modern approaches are designed for controllable…

Optimization and Control · Mathematics 2022-06-13 Yonathan Efroni , Sham Kakade , Akshay Krishnamurthy , Cyril Zhang

This work develops a measurement-driven and model-based formal verification approach, applicable to systems with partly unknown dynamics. We provide a principled method, grounded on reachability analysis and on Bayesian inference, to…

Systems and Control · Computer Science 2015-09-14 Sofie Haesaert , Paul M. J. Van den Hof , Alessandro Abate

Partial observability and controllability are two well-known issues in test-case synthesis for interactive systems. We address the problem of partial control in the synthesis of test cases from timed-automata specifications. Building on the…

Formal Languages and Automata Theory · Computer Science 2018-05-04 Léo Henry , Thierry Jéron , Nicolas Markey

We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…

Computer Science and Game Theory · Computer Science 2012-07-03 Krishnendu Chatterjee , Martin Chmelik , Rupak Majumdar

A robust model predictive control scheme for a class of constrained norm-bounded uncertain discrete-time linear systems is developed under the hypothesis that only partial state measurements are available for feedback. Off-line calculations…

Systems and Control · Computer Science 2018-07-23 Giuseppe Franzè , Massimiliano Mattei , Luciano Ollio , Valerio Scordamaglia

Formal verification provides strong safety guarantees but only for models of cyber-physical systems. Hybrid system models describe the required interplay of computation and physical dynamics, which is crucial to guarantee what computations…

Logic in Computer Science · Computer Science 2019-02-26 Stefan Mitsch , André Platzer

Inverse optimal control can be used to characterize behavior in sequential decision-making tasks. Most existing work, however, is limited to fully observable or linear systems, or requires the action signals to be known. Here, we introduce…

Machine Learning · Computer Science 2023-10-31 Dominik Straub , Matthias Schultheis , Heinz Koeppl , Constantin A. Rothkopf

In this paper we consider a control problem for a Partially Observable Piecewise Deterministic Markov Process of the following type: After the jump of the process the controller receives a noisy signal about the state and the aim is to…

Optimization and Control · Mathematics 2021-07-21 Nicole Bäuerle , Dirk Lange

This paper addresses the problem of improving response times of robots implemented in the Robotic Operating System (ROS) using formal verification of computational-time feasibility. In order to verify the real time behaviour of a robot…

Robotics · Computer Science 2016-11-11 Mohammed Y. Hazim , Hongyang Qu , Sandor M. Veres

Probabilistic model checking is a technique for formal automated reasoning about software or hardware systems that operate in the context of uncertainty or stochasticity. It builds upon ideas and techniques from a diverse range of fields,…

Logic in Computer Science · Computer Science 2023-08-08 David Parker

We consider systems under uncertainty whose dynamics are partially unknown. Our aim is to study satisfaction of temporal logic properties by trajectories of such systems. We express these properties as signal temporal logic formulas and…

Systems and Control · Electrical Eng. & Systems 2020-05-12 Ali Salamati , Sadegh Soudjani , Majid Zamani

Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show…

Logic in Computer Science · Computer Science 2019-03-14 Marcin Jurdzinski , Francois Laroussinie , Jeremy Sproston

This paper presents a novel approach for augmenting proof-based verification with performance-style analysis of the kind employed in state-of-the-art model checking tools for probabilistic systems. Quantitative safety properties usually…

Logic in Computer Science · Computer Science 2009-12-11 Ukachukwu Ndukwu

We investigate the problem of monitoring partially observable systems with nondeterministic and probabilistic dynamics. In such systems, every state may be associated with a risk, e.g., the probability of an imminent crash. During runtime,…

Logic in Computer Science · Computer Science 2021-05-27 Sebastian Junges , Hazem Torfah , Sanjit A. Seshia

A classical method for model-checking timed properties-such as those expressed using timed extensions of temporal logic-is to rely on the use of observers. In this context, a major problem is to prove the correctness of observers.…

Logic in Computer Science · Computer Science 2015-09-23 Silvano Dal Zilio , Bernard Berthomieu
‹ Prev 1 2 3 10 Next ›