2,653 research outputs found
Specifications for decidable hybrid games
Abstract We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid System
Model Checking the Quantitative mu-Calculus on Linear Hybrid Systems
We study the model-checking problem for a quantitative extension of the modal
mu-calculus on a class of hybrid systems. Qualitative model checking has been
proved decidable and implemented for several classes of systems, but this is
not the case for quantitative questions that arise naturally in this context.
Recently, quantitative formalisms that subsume classical temporal logics and
allow the measurement of interesting quantitative phenomena were introduced. We
show how a powerful quantitative logic, the quantitative mu-calculus, can be
model checked with arbitrary precision on initialised linear hybrid systems. To
this end, we develop new techniques for the discretisation of continuous state
spaces based on a special class of strategies in model-checking games and
present a reduction to a class of counter parity games.Comment: LMCS submissio
A Game-Theoretic approach to Fault Diagnosis of Hybrid Systems
Physical systems can fail. For this reason the problem of identifying and
reacting to faults has received a large attention in the control and computer
science communities. In this paper we study the fault diagnosis problem for
hybrid systems from a game-theoretical point of view. A hybrid system is a
system mixing continuous and discrete behaviours that cannot be faithfully
modeled neither by using a formalism with continuous dynamics only nor by a
formalism including only discrete dynamics. We use the well known framework of
hybrid automata for modeling hybrid systems, and we define a Fault Diagnosis
Game on them, using two players: the environment and the diagnoser. The
environment controls the evolution of the system and chooses whether and when a
fault occurs. The diagnoser observes the external behaviour of the system and
announces whether a fault has occurred or not. Existence of a winning strategy
for the diagnoser implies that faults can be detected correctly, while
computing such a winning strategy corresponds to implement a diagnoser for the
system. We will show how to determine the existence of a winning strategy, and
how to compute it, for some decidable classes of hybrid automata like o-minimal
hybrid automata.Comment: In Proceedings GandALF 2011, arXiv:1106.081
The Cowl - v.83 - n.18 - Feb 28, 2019
The Cowl - student newspaper of Providence College. Vol. 83 No. 18 - February 28, 2019. 24 pages
Daily Eastern News: January 14, 2021
https://thekeep.eiu.edu/den_2021_jan/1003/thumbnail.jp
- …