Sciweavers

423 search results - page 78 / 85
» The Generalization of Generalized Automata: Expression Autom...
Sort
View
FAC
2008
139views more  FAC 2008»
13 years 8 months ago
Network invariants for real-time systems
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
Olga Grinchtein, Martin Leucker
FUIN
2006
85views more  FUIN 2006»
13 years 8 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang
FUIN
2006
85views more  FUIN 2006»
13 years 8 months ago
Decidability and Universality in Symbolic Dynamical Systems
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of univers...
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blon...
JIIS
2008
89views more  JIIS 2008»
13 years 8 months ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
MST
2010
111views more  MST 2010»
13 years 7 months ago
Sturmian Trees
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...