Sciweavers

135 search results - page 5 / 27
» Relating timed and register automata
Sort
View
HYBRID
1999
Springer
14 years 5 days ago
As Soon as Possible: Time Optimal Control for Timed Automata
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...
Eugene Asarin, Oded Maler
CSL
2010
Springer
13 years 9 months ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
CONCUR
2005
Springer
13 years 9 months ago
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
Pedro R. D'Argenio, Biniam Gebremichael
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
13 years 11 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...