7064 search results - page 144 / 1413 » From States to Histories |
187
click to vote
DATE
1999
IEEE
15 years 10 months ago
1999
IEEE
Reachability analysis of finite state machines is essential to many computer-aided design applications. We present new techniques to improve both approximate and exact reachabilit...
171
click to vote
ECP
1999
Springer
15 years 10 months ago
1999
Springer
We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can mod...
210
click to vote
ACSD
1998
IEEE
15 years 10 months ago
1998
IEEE
We implement a finite state machine (FSM) domain for specifying and simulating control functionality of a system within the Ptolemy software environment. The FSM domain is success...
183
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
The intrinsic complexity of most protocol speci cations in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model...
161
click to vote
AADEBUG
1997
Springer
15 years 10 months ago
1997
Springer
Currently, few tools are available for assisting developers with debugging intelligent systems. Because these systems rely heavily on context dependent knowledge and sometimes sto...