15 search results - page 2 / 3 » From Discrete Duration Calculus to Symbolic Automata |
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
CAV
2003
Springer
13 years 10 months ago
2003
Springer
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
ENTCS
2006
13 years 5 months ago
2006
We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over...
MCS
2007
Springer
13 years 5 months ago
2007
Springer
Using standard calculus, explicit formulas for the one-dimensional continuous and discrete homotopy operators are derived. It is shown that these formulas are equivalent to those ...
JAIR
2006
13 years 5 months ago
2006
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...