11716 search results - page 197 / 2344 » Computable symbolic dynamics |
164
click to vote
CHARME
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
171
click to vote
IDEAL
2003
Springer
15 years 11 months ago
2003
Springer
This paper describes the multi-agent organization of a computer system that was designed to assist operators in decision making in the presence of emergencies. The application was ...
125
click to vote
ICC
2000
IEEE
15 years 11 months ago
2000
IEEE
We proposed a novel interleaving technique, namely ada,ptive interleaving, which can break the bursty channel errors more effectively than traditional block interleaving. This new...
164
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes a probabilistic approach to state space search. The presented method applies a ranking of the design states according to their probability of reaching a given...
169
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...