Sciweavers

259 search results - page 21 / 52
» Bounded Model Checking for Timed Automata
Sort
View
87
Voted
LATA
2009
Springer
15 years 4 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
65
Voted
ENTCS
2006
99views more  ENTCS 2006»
14 years 9 months ago
Termination Criteria for Bounded Model Checking: Extensions and Comparison
Increasing attention has been paid recently to criteria that allow one to conclude that a structure models a linear-time property from the knowledge that no counterexamples exist ...
Mohammad Awedh, Fabio Somenzi
ATVA
2008
Springer
104views Hardware» more  ATVA 2008»
14 years 11 months ago
A Direct Algorithm for Multi-valued Bounded Model Checking
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
Jefferson O. Andrade, Yukiyoshi Kameyama
CONCUR
2010
Springer
14 years 10 months ago
Kleene, Rabin, and Scott Are Available
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger ...
TCS
2010
14 years 7 months ago
Detecting synchronisation of biological oscillators by model checking
We define a subclass of timed automata, called oscillator timed automata, suitable to model biological oscillators. Coupled biological oscillators may synchronise, as emerging be...
Ezio Bartocci, Flavio Corradini, Emanuela Merelli,...