6608 search results - page 240 / 1322 » On the Completeness of Model Checking |
153
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
We develop a sound foundation for model checking algorithms for the class of PRS-style BDI agents, by showing how a reachability graph for any given PRS-type agent can be construc...
155
click to vote
DSRT
2008
IEEE
16 years 10 days ago
2008
IEEE
This paper describes a new property checking approach in order to enhance the diagnosis ability of an electronic embedded system, included in an automotive application. We conside...
134
click to vote
IPL
2008
15 years 5 months ago
2008
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper inte...
125
click to vote
ASSETS
2006
ACM
15 years 12 months ago
2006
ACM
We present a major extension to our previous work on Trackball EdgeWrite—a unistroke text entry method for trackballs—by taking it from a character-level technique to a word-l...
157
click to vote
EAAI
2008
15 years 6 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...