5216 search results - page 1012 / 1044 » Planning as Model Checking |
103
click to vote
ISSRE
2000
IEEE
15 years 2 months ago
2000
IEEE
Despite the growing interest for component-based systems, few works tackle the question of the trust we can bring into a component. This paper presents a method and a tool for bui...
102
click to vote
WETICE
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents joint work by the California Institute of Technology’s Jet Propulsion Laboratory and the University of California at Davis (UC Davis) sponsored by the Nation...
ESEC
1999
Springer
15 years 2 months ago
1999
Springer
The use of smart cards to run software modules on demand has become a major business concern for application issuers. Such downloadable executable content requires to be trusted by...
ICALP
1998
Springer
15 years 2 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
120
click to vote
PODS
1994
ACM
15 years 2 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...