235 search results - page 15 / 47 » A Symbolic Symbolic State Space Representation |
ICTAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
78
Voted
ICRA
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— We study the problem of designing control strategies for nondeterministic transitions systems enforcing the satisfaction of Linear Temporal Logic (LTL) formulas over th...
MEMOCODE
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
TACAS
2005
Springer
15 years 3 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Te...