Improved algorithms for parity and Streett objectives

K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).

Download
OA 582.94 KB

Journal Article | Published | English
Author
; ;
Department
Abstract
The computation of the winning set for parity objectives and for Streett objectives in 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-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.
Publishing Year
Date Published
2017-09-26
Journal Title
Logical Methods in Computer Science
Volume
13
Issue
3
Article Number
26
ISSN
IST-REx-ID

Cite this

Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017
Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science, 13(3). https://doi.org/10.23638/LMCS-13(3:26)2017
Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science 13, no. 3 (2017). https://doi.org/10.23638/LMCS-13(3:26)2017.
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3).
Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.
All files available under the following license(s):
Creative Commons License:
CC-BY-NDCreative Commons Attribution-NoDerivates (CC BY-ND 4.0)
Main File(s)
Access Level
OA Open Access
Last Uploaded
2018-12-12T10:13:27Z


Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar