Conference paper
Symmetry Reduction in Infinite Games with Finite Branching
Symmetry reduction has been applied extensively for verification of finite state concurrent systems and hardware designs using model-checking of the temporal logics LTL, CTL and CTL, as well as real-time and probabilistic system model-checking. In this paper we extend the technique to handle infinite-state games on graphs with finite branching where the objectives of the players can be very general.
As particular applications, it is shown that the technique can be applied to reduce the state space in parity games as well as when doing modelchecking of the Alternating-time temporal logic ATL.
Language: | English |
---|---|
Publisher: | Springer |
Year: | 2014 |
Pages: | 281-296 |
Proceedings: | 12th International Symposium on Automated Technology for Verification and AnalysisInternational Symposium on Automated Technology for Verification and Analysis |
Series: | Lecture Notes in Computer Science |
ISBN: | 3319119354 , 3319119362 , 9783319119359 and 9783319119366 |
ISSN: | 03029743 |
Types: | Conference paper |
DOI: | 10.1007/978-3-319-11936-6_21 |