788 search results - page 71 / 158 » Symbolic Equivalence Checking |
PUK
2000
13 years 9 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
We consider the problem of controlling a continuous-time linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicate...
KI
2010
Springer
13 years 2 months ago
2010
Springer
A service robot should be able to automatically plan manipulation actions to help people in domestic environments. Following the classic senseplan-act cycle, in this paper we prese...
FM
1994
Springer
13 years 12 months ago
1994
Springer
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...