Improved Algorithms for One-Pair and k-Pair Streett Objectives

The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verific...

Full description

Saved in:
Bibliographic Details
Published in2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 269 - 280
Main Authors Chatterjee, Krishnendu, Henzinger, Monika, Loitzenbauer, Veronika
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2015
Subjects
Automata
Computer science
Computer-aided verification
Games
Graph algorithms
Graph games
Image edge detection
Open systems
Parity games
Runtime
Streett automata
Synthesis
Online AccessGet full text
ISSN1043-6871
DOI10.1109/LICS.2015.34

Cover

More Information
Summary:The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formed ness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years.
ISSN:1043-6871
DOI:10.1109/LICS.2015.34