29 search results - page 6 / 6 » On the Proof Theory of the Modal mu-Calculus |
120
click to vote
CSL
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
154
click to vote
CORR
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
113
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
109
Voted
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning a...