Papers by Daniele Beauquier
Fundamenta Informaticae, 2009
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
We propose here a tool which implements an algorithm proposed for a decidable class of verificati... more We propose here a tool which implements an algorithm proposed for a decidable class of verification problems and we illustrate the efficiency of the method by giving an automatic treatment of the well-known benchmark called the Generalized Railroad Crossing Problem. The controller is specified (in all its generality) as a 4-line long Gurevich Abstract State Machines (ASM) which is then automatically translated into a FOTL formula which characterizes its set of runs.
Bookmarks Related papers MentionsView impact
Eprint Arxiv Cs 0703140, Mar 28, 2007
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1991
We modify an acceptance condition of Büchi automaton on infinite trees: rather than to require th... more We modify an acceptance condition of Büchi automaton on infinite trees: rather than to require that each computation path is successful, we impose various restrictions on the number of successful paths in a run of the automaton on a tree. All these modifications alter the recognizing power of Büchi automata. We examine the classes induced by the acceptance conditions that
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1985
Sans résumé
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1997
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1995
We consider some complexity questions concerning a model of uncertainty known as Markov decision ... more We consider some complexity questions concerning a model of uncertainty known as Markov decision processes. Our results concern the problem of constructing optimal policies under a criterion of optimality defined in terms of constraints on the behavior of the process. The constraints are described by regular languages, and the motivation goes from robot motion planning. It is known that, in
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1999
We consider a first order timed logic that is an extension of the theory of real addition and sca... more We consider a first order timed logic that is an extension of the theory of real addition and scalar multiplications (by rational numbers) by unary functions and predicates of time. The time is treated as non negative reals. This logic seems to be well adapted to a direct, full-scale specification of real-time systems. It also suffices to describe runs of
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1984
We are interested in infinitary languages recognized by a pushdown automaton. We, then, give theo... more We are interested in infinitary languages recognized by a pushdown automaton. We, then, give theorems of characterization of such closed, central, normal or perfect languages (considering a number of hypothesis of continuity in computations of the automaton, for last three classes). Besides, it is proved that, given the same hypothesis, the largest central (respectively normal, perfect, language included in an algebraic infinitary language, remains algebraic.
Bookmarks Related papers MentionsView impact
Theoretical Computer Science, 1995
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science
We prove that the family Rec(ωAω) of regular sets of bi-infinite words is equal to the family of ... more We prove that the family Rec(ωAω) of regular sets of bi-infinite words is equal to the family of sets recognized by a deterministic Muller automaton. That extends a theorem of Mc Naughton for one sided infinite words to the case of bi-infinite words.
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2004
Bookmarks Related papers MentionsView impact
... 487, The algorithmic analysis of hybrid systems - Alur, Courcoubetis, et al. - 1995. 381, Evo... more ... 487, The algorithmic analysis of hybrid systems - Alur, Courcoubetis, et al. - 1995. 381, Evolving algebras 1993: Lipari guide - Gurevich - 1995. 299, Hybrid automata: an algorithmic approach to the speci cation and veri cation of hybrid systems - Alur, Courcoubetis, et al. ...
Bookmarks Related papers MentionsView impact
Theoretical Computer Science, 2002
Bookmarks Related papers MentionsView impact
Theoretical Computer Science, 1994
Bookmarks Related papers MentionsView impact
Theoretical Computer Science, 2003
Bookmarks Related papers MentionsView impact
Journal of Logic and Computation, 2006
Bookmarks Related papers MentionsView impact
Journal of Logic and Computation, 2002
Bookmarks Related papers MentionsView impact
Uploads
Papers by Daniele Beauquier