Structural Presburger digit vector automata

We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modali- ties, also known as

Unité de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

Selon Robert Mayer et Francine Ouellet (2000, p.289), la recherche-action « vise à produire un savoir valable et utile pour l’action. » C’est cela qui m’a motivée à choisir ce

This paper addresses the problem of computing the exact reachability set of hybrid automata, which are finite-state machines extended with real variables that obey continuous

Dierent techniques [11] and tools have been developed for manipulating the Presburger-denable sets (the sets of integer vectors satisfying a Presburger formula): by working directly

(C) holds if each atomic predicate of P is computable for large inputs by a succinct protocol with helpers and reversible dynamic initialization (D).. Section 5.4 shows that (D)

Given this basic idea, it remains to devise a translation of the program of an arbitrary two-counter machine into a suitable set of sentences from the universal fragment of