1116 search results - page 20 / 224 » Applying Predicate Abstraction to Abstract State Machines |
ICCAD
2000
IEEE
15 years 3 months ago
2000
IEEE
Most hardware description frameworks, whether schematic or textual, use cooperating finite state machines (CFSM) as the underlying abstraction. In the CFSM framework, a designer ...
173
click to vote
NEUROSCIENCE
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
78
Voted
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Hierarchical and recursive state machines are suitable abstract models for many software systems. In this paper we extend a model recently introduced in literature, by al...
167
click to vote
ETVC
2008
15 years 25 days ago
2008
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
100
click to vote
AAAI
2008
15 years 1 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...