575 search results - page 103 / 115 » Model Checking Restricted Sets of Timed Paths |
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily ...
ASE
2002
13 years 7 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
DATE
1998
IEEE
13 years 11 months ago
1998
IEEE
Most memory test algorithms are optimized tests for a particular memory technology and a particular set of fault models, under the assumption that the memory is bit-oriented; i.e....
AAAI
2000
13 years 8 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
Learning to fly an aircraft is a complex task that requires the development of control skills and goal achievement strategies. This paper presents a behavioural cloning system tha...