Sciweavers

3169 search results - page 26 / 634
» Robust Timed Automata
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
Pawel Parys, Igor Walukiewicz
ENTCS
2007
156views more  ENTCS 2007»
13 years 8 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...
ACRI
2006
Springer
14 years 2 months ago
Scale-Free Automata Networks Are Not Robust in a Collective Computational Task
Christian Darabos, Mario Giacobini, Marco Tomassin...
HYBRID
1995
Springer
14 years 5 days ago
Interconnected Automata and Linear Systems: A Theoretical Framework in Discrete-Time
This paper summarizes the definitions and several of the main results of an approach to hybrid systems, which combines finite automata and linear systems, developed by the author...
Eduardo D. Sontag