333 search results - page 55 / 67 » On the complexity of partial order trace model checking |
FMCAD
2004
Springer
13 years 11 months ago
2004
Springer
In this paper we demonstrate a potential extension of formal verification methodology in order to deal with time-domain properties of analog and mixed-signal circuits whose dynamic...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
FOIS
2006
13 years 9 months ago
2006
The field of BioInformatics has become a major venue for the development and application of computational ontologies. Ranging from controlled vocabularies to annotation of experim...
DLOG
2004
13 years 9 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— The rapidly increasing complexity of tasks robotic systems are expected to carry out underscores the need for the development of motion planners that can take into account disc...