64 search results - page 7 / 13 » Solving Parity Games in Practice |
107
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
CAV
2006
Springer
15 years 3 months ago
2006
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
CAV
2009
Springer
16 years 6 days ago
2009
Springer
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
101
click to vote
CAV
2003
Springer
15 years 4 months ago
2003
Springer
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...
90
Voted
ITA
2007
14 years 11 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...