In a previous work, we showed that a kind of ω-automata known as Transition-based Generalized Testing Automata (TGTA) can outperform the Büchi automata traditionally used for explicit model checking when verifying stutter-invariant properties. In this work, we investigate the use of these generalized testing automata to improve symbolic model checking of stutter-invariant LTL properties. We pro...

The use of formal methods, techniques and tools may generally guarantee a systems’ safe operation. Such a process includes system modeling with a mathematical model, which is an approximation of the physical system, and is used to make easier the next step of analysis. Formal analysis of hybrid systems, which involve mixed continuous-valued and discrete dynamics, is concerned with verifying whe...

We relate two diierent approaches for the speciication and veriication of hybrid systems. The rst one is logic-based and uses the framework of the Calculus of Durations (CoD), the second one is automata-based and uses algorithmic analysis techniques for hybrid automata. Fragments of CoD have been identiied in 13, 19] for the description of control systems and their requirements. We mainly show ...

Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. While computability issues concerning safety properties have been extensively studied, liveness properties have remained largely uninvestigated. In this article, we investigate de-cidability of state recurrence and of progress properties...

Hybrid automata ooer a framework for the description of systems with both discrete and continuous components, such as digital technology embedded in an analogue environment. Traditional uses of hybrid automata express choice of transitions purely in terms of nondeterminism, abstracting potentially signiicant information concerning the relative likelihood of certain behaviours. To model such pro...

Undecidability of the reachability problem is ubiquitous in the context of hybrid automata. Being mostly based on either bounded reachability or on the notion of simulation preorder, current techniques for the approximated reachability analysis force to choose between underand over-approximations. In this paper, we introduce a novel method for the reachability analysis of hybrid automata featur...

This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational value. We show that, in contrast to the classical (unbounded) reachability problem, the timed-bounded version is decidable for rectangular hybrid automata provide...

In this paper we extend three classical and fundamental results in polyhedral geometry, namely, Carath\'{e}odory's theorem, the Minkowski-Weyl Gordan's lemma to infinite dimensional spaces, which considered cones monoids are invariant under actions of symmetric groups.

This paper deals with the synthesis of control software for hybrid systems speciied as hybrid automata. Instead of generating the software from scratch, the synthesis is based on a generic layered software architecture which supports both periodic and event-triggered computations. The use of the layered software architecture as the framework for implementing hybrid controllers is motivated in t...

One dimensional cellular automata are analyzed via their generalized permutivity. Invariant subalphabets provide a systematic way of identifying periodic and aperiodic tilings as well as stationary distributions invariant under the cellular automaton iteration. In the case of several invariant subalphabets a hierarchy of interaction phenomena arise. In particular the interaction of subalphabets...