2035 search results - page 324 / 407 » On the complexity of stratified logics |
GLVLSI
2009
IEEE
15 years 5 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
SEFM
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...
TIME
2009
IEEE
15 years 5 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
72
Voted
ICRA
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— Robotic manipulation is important for real, physical world applications. General Purpose manipulation with a robot (eg. delivering dishes, opening doors with a key, etc...
ATAL
2009
Springer
15 years 5 months ago
2009
Springer
The ability to guarantee that a system will continue to operate correctly under degraded conditions is key to the success of adopting multi-agent systems (MAS) as a paradigm for d...