15 search results - page 3 / 3 » From Discrete Duration Calculus to Symbolic Automata |
FORMATS
2010
Springer
13 years 3 months ago
2010
Springer
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
IEEECIT
2010
IEEE
13 years 3 months ago
2010
IEEE
The quality of the numeric simulation of hybrid systems highly depends on the capability of the simulator to detect discrete events during continuous evolutions. Due to the intera...
CAV
2007
Springer
13 years 11 months ago
2007
Springer
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
ESOP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...