Sciweavers

29 search results - page 6 / 6
» On the Proof Theory of the Modal mu-Calculus
Sort
View
CSL
2009
Springer
13 years 11 months ago
Model Checking FO(R) over One-Counter Processes and beyond
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...
Anthony Widjaja To
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 2 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
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...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
FOCS
1998
IEEE
13 years 9 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
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...
John C. Mitchell, Mark Mitchell, Andre Scedrov
ATAL
2008
Springer
13 years 6 months ago
Modelling coalitions: ATL + argumentation
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...
Nils Bulling, Jürgen Dix, Carlos Iván ...