15792 search results - page 2649 / 3159 » Computational Abstraction Steps |
188
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
171
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
181
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Synthesis is the automatic construction of a system from its specification. In the classical synthesis algorithms it is always assumed the system is “constructed from ...
187
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
177
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...