Sciweavers

75 search results - page 14 / 15
» Mean-Payoff Parity Games
Sort
View
FSTTCS
2005
Springer
13 years 11 months ago
Fixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
CAV
2009
Springer
155views Hardware» more  CAV 2009»
14 years 6 months ago
Better Quality in Synthesis through Quantitative Objectives
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
Roderick Bloem, Krishnendu Chatterjee, Thomas A. H...
FOSSACS
2010
Springer
13 years 9 months ago
Degrees of Lookahead in Regular Infinite Games
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...
Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas
IANDC
2006
113views more  IANDC 2006»
13 years 6 months ago
Automata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Yde Venema
CAV
2003
Springer
160views Hardware» more  CAV 2003»
13 years 11 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek