Concurrent small progress measures

Authors:
Michael Huth;Jim Huan-Pu Kuo;Nir Piterman
Affiliations:
Department of Computing, Imperial College London, London, United Kingdom;Department of Computing, Imperial College London, London, United Kingdom;Department of Computer Science, University of Leicester, Leicester, United Kingdom
Venue:
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Year:
2011

Citing 10
Cited 0

On the synthesis of a reactive module

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Infinite games on finitely coloured graphs with applications to automata on infinite trees

Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP

Information Processing Letters
Results on the Propositional µ-Calculus

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Small Progress Measures for Solving Parity Games

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Lokal Model Checking Games

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Multi-Core Solver for Parity Games

Electronic Notes in Theoretical Computer Science (ENTCS)
Solving Parity Games in Practice

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
A decision procedure for CTL* based on tableaux and automata

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report on multi-core implementations of parity game solvers based on Small Progress Measures. We revisit a known implementation of multi-core machines (PW solver), and change, in what we call the PWe solver, the way it computes progress measures. We then suggest an alternative implementation (CSPM), that reduces logical dependency on configuration state and makes performance less dependent on configuration details. In experimental evaluation, both PWe and CSPM out-perform PW. On most benchmarks, especially larger ones, CSPM performs better than PWe. The observed linear speed-up of parallelization shows great promise for parallel implementations of game solvers.