Abstract
Many analysis and verifications tasks, such as static program analyses and model-checking for temporal logics, reduce to the solution of systems of equations over suitable lattices. Inspired by recent work on lattice-theoretic progress measures, we develop a game-theoretical approach to the solution of systems of monotone equations over lattices, where for each single equation either the least or greatest solution is taken. A simple parity game, referred to as fixpoint game, is defined that provides a correct and complete characterisation of the solution of systems of equations over continuous lattices, a quite general class of lattices widely used in semantics. For powerset lattices the fixpoint game is intimately connected with classical parity games for µ-calculus model-checking, whose solution can exploit as a key tool Jurdziński’s small progress measures. We show how the notion of progress measure can be naturally generalised to fixpoint games over continuous lattices and we prove the existence of small progress measures. Our results lead to a constructive formulation of progress measures as (least) fixpoints. We refine this characterisation by introducing the notion of selection that allows one to constrain the plays in the parity game, enabling an effective (and possibly efficient) solution of the game, and thus of the associated verification problem. We also propose a logic for specifying the moves of the existential player that can be used to systematically derive simplified equations for efficiently computing progress measures. We discuss potential applications to the model-checking of latticed µ-calculi.
Supplemental Material
- Samson Abramsky and Achim Jung. 1994. Domain Theory. In Handbook of Logic in Computer Science, Samson Abramsky, Dov Gabbay, and Thomas Stephen Edward Maibaum (Eds.). Oxford University Press, 1–168. Google Scholar
Digital Library
- Shaull Almagor, Udi Boker, and Orna Kupferman. 2014. Discounting in LTL. In Proc. of TACAS ’14 (Lecture Notes in Computer Science), Vol. 8413. Springer, 424–439.Google Scholar
Cross Ref
- Paolo Baldan, Barbara König, Christina Mika-Michalski, and Tommaso Padoan. 2018. Fixpoint Games on Continuous Lattices. https://arxiv.org/abs/1810.11404 arXiv:1810.11404.Google Scholar
- Harsh Beohar, Barbara König, Sebastian Küpper, and Alexandra Silva. 2017. Conditional Transition Systems with Upgrades. In Proc. of TASE ’17. IEEE Xplore, 1–8.Google Scholar
Cross Ref
- Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, and Dusko Pavlovic. 2018. Sound up-to techniques and Complete abstract domains. In Proc. of LICS ’18. ACM, 175–184. Google Scholar
Digital Library
- Julian Bradfield and Igor Walukiewicz. 2018. The mu-Calculus and Model Checking. In Handbook of Model Checking, Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem (Eds.). Springer, 871–919.Google Scholar
- Anca Browne, Edmund M. Clarke, Somesh Jha, David E. Long, and Wilfredo R. Marrero. 1997. An improved algorithm for the evaluation of fixpoint expressions. Theoretical Computer Science 178, 1–2 (1997), 237–255. Google Scholar
Digital Library
- Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, and Frank Stephan. 2017. Deciding parity games in quasipolynomial time. In Proc. of STOC ’17. ACM, 252–263. Google Scholar
Digital Library
- Rance Cleaveland. 1990. Tableau-based model checking in the propositional mu-calculus. Acta Informatica 27, 8 (1990), 725–747. Google Scholar
Digital Library
- Rance Cleaveland, Marion Klein, and Bernhard Steffen. 1992. Faster model checking for the modal Mu-Calculus. In Proc. of CAV 1992 (Lecture Notes in Computer Science), Vol. 663. Springer, 410–422. Google Scholar
Digital Library
- Maxime Cordy, Andreas Classen, Gilles Perrouin, Pierre-Yves Schobbens, Patrick Heymans, and Axel Legay. 2012. Simulationbased abstractions for software product-line model checking. In Proc. of ICSE ’12. IEEE, 672–682. Google Scholar
Digital Library
- Patrick Cousot and Radhia Cousot. 1977. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. of POPL ’77 (Los Angeles, California). ACM, 238–252. Google Scholar
Digital Library
- Radhia Cousot and Patrick Cousot. 1979. Constructive versions of Tarski’s fixed point theorems. Pacific J. Math. 82, 1 (1979), 43–57.Google Scholar
Cross Ref
- Brian A. Davey and Hilary A. Priestley. 2002. Introduction to lattices and order. Cambridge University Press.Google Scholar
- Giorgio Delzanno and Jean-François Raskin. 2000. Symbolic Representation of Upward-Closed Sets. In Proc. of TACAS ’00 (Lecture Notes in Computer Science), Susanne Graf and Michael I. Schwartzbach (Eds.), Vol. 1785. Springer, 426–440. Google Scholar
Digital Library
- Pantelis E. Eleftheriou, Costas D. Koutras, and Christos Nomikos. 2012. Notions of bisimulation for Heyting-valued modal languages. Journal of Logic and Computation 22 (2012), 213–235. Google Scholar
Digital Library
- E. Allen Emerson. 1985. Automata, tableaux, and temporal logics. In Proceedings of Logics of Programs 1985 (Lecture Notes in Computer Science), R. Parikh (Ed.), Vol. 193. Springer, 79–88. Google Scholar
Digital Library
- E. Allen Emerson and Charanjit S. Jutla. 1991. Tree automata, Mu-Calculus and determinacy. In Proc. of SFCS ’91. IEEE, 368–377. Google Scholar
Digital Library
- Melvin Fitting. 1991. Many-valued modal logics. Fundamenta Informaticae 15 (1991), 235–254. Google Scholar
Cross Ref
- Gaëlle Fontaine. 2008. Continuous Fragment of the µ-Calculus. In Proc. of CSL ’08 (Lecture Notes in Computer Science), Vol. 5213. Springer, 139–153. Google Scholar
Digital Library
- Thomas Martin Gawlitza and Helmut Seidl. 2011. Solving systems of rational equations through strategy iteration. ACM Trans. Program. Lang. Syst. 33, 3 (2011), 11:1–11:48. Google Scholar
Digital Library
- Gerhard Gierz, Karl H. Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, and Dana S. Scott. 2003. Continuous Lattices and Domains. Cambridge University Press.Google Scholar
- Orna Grumberg, Martin Lange, Martin Leucker, and Sharon Shoham. 2005. Don’t Know in the µ-Calculus. In Proc. of VMCAI ’05 (Lecture Notes in Computer Science), Radhia Cousot (Ed.), Vol. 3385. Springer, 233–249.Google Scholar
- Helle Hvid Hansen, Clemens Kupke, Johannes Marti, and Yde Venema. 2017. Parity Games and Automata for Game Logic. In Proc. of DALI ’17 (Lecture Notes in Computer Science), Vol. 10669. Springer, 115–132.Google Scholar
- Ichiro Hasuo, Shunsuke Shimizu, and Corina Cîrstea. 2016. Lattice-theoretic progress measures and coalgebraic model checking. In Proc. of POPL ’16. ACM, 718–732. Google Scholar
Digital Library
- Daniel Hirschkoff. 1998. Automatically Proving Up To Bisimulation. In Proc. of MFCS ’98 Workshop on Concurrency (Electronic Notes in Theoretical Computer Science). Elsevier, 75–89.Google Scholar
Cross Ref
- Michael Huth and Marta Kwiatkowska. 1997. Quantitative analysis and model checking. In Proc. of LICS ’97. IEEE, 111–122. Google Scholar
Digital Library
- Marcin Jurdziński. 2000. Small Progress Measures for Solving Parity Games. In Proc. of STACS ’00 (Lecture Notes in Computer Science), Vol. 1770. Springer, 290–301. Google Scholar
Digital Library
- Dexter Kozen. 1983. Results on the Propositional µ-Calculus. Theoretical Computer Science 27, 3 (1983), 333–354.Google Scholar
Cross Ref
- Orna Kupfermann and Yoad Lustig. 2007. Latticed Simulation Relations and Games. In Proc. of ATVA ’07 (Lecture Notes in Computer Science), Vol. 4672. Springer, 316–330. Google Scholar
Digital Library
- Angelika Mader. 1997. Verification of Modal Properties Using Boolean Equation Systems. Ph.D. Dissertation. TU München.Google Scholar
- Annabelle McIver and Carroll Morgan. 2007. Results on the quantitative µ-calculus qMµ. ACM Trans. Comp. Log. 8, 1:3 (2007), 43. Google Scholar
Digital Library
- Matteo Mio. 2012. On the Equivalence of Game and Denotational Semantics for the Probabilistic µ-Calculus. Logical Methods in Computer Science 8, 2:07 (2012), 1–21.Google Scholar
Cross Ref
- Matteo Mio and Alex Simpson. 2015. Łukasiewicz µ-calculus. https://arxiv.org/abs/1510.00797 arXiv:1510.00797.Google Scholar
- Matteo Mio and Alex Simpson. 2017. Łukasiewicz µ-calculus. Fundamenta Informaticae 150, 3-4 (2017), 317–346.Google Scholar
Cross Ref
- Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. 1999. Principles of Program Analysis. Springer. Google Scholar
Digital Library
- Katja Poltermann. 2017. A Modal Logic for Conditional Transition Systems. Bachelor’s thesis. Universität Duisburg-Essen.Google Scholar
- Damien Pous and Davide Sangiorgi. 2011. Enhancements of the bisimulation proof method. In Advanced Topics in Bisimulation and Coinduction, Davide Sangiorgi and Jan Rutten (Eds.). Cambridge University Press.Google Scholar
- Davide Sangiorgi. 2011. Introduction to Bisimulation and Coinduction. Cambridge University Press. Google Scholar
- Klaus Schneider. 2004. Verification of Reactive Systems: Formal Methods and Algorithms. Springer. Google Scholar
Digital Library
- Dana Scott. 1972. Continuous lattices. In Toposes, Algebraic Geometry and Logic (Lecture Notes in Mathematics), F. W. Lawvere (Ed.). Springer, 97–136.Google Scholar
- Helmut Seidl. 1996. Fast and simple nested fixpoints. Inform. Process. Lett. 59, 6 (1996), 303–308. Google Scholar
Digital Library
- Perdita Stevens and Colin Stirling. 1998. Practical Model-Checking Using Games. In Proc. of TACAS ’98 (Lecture Notes in Computer Science), Vol. 1384. Springer, 85–101. Google Scholar
Digital Library
- Colin Stirling. 1995. Local Model Checking Games. In Proc. of CONCUR ’95 (Lecture Notes in Computer Science), Vol. 962. Springer, 1–11. Google Scholar
Digital Library
- Colin Stirling and David Walker. 1991. Local Model Checking in the Modal mu-Calculus. Theoretical Computer Science 89, 1 (1991), 161–177. Google Scholar
Digital Library
- Alfred Tarski. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5 (1955), 285–309.Google Scholar
Cross Ref
- Franck van Breugel and James Worrell. 2005. A behavioural pseudometric for probabilistic transition systems. Theoretical Computer Science 331 (2005), 115–142. Google Scholar
Digital Library
- Yde Venema. 2008. Lectures on the modal µ-calculus. Lecture notes, Institute for Logic, Language and Computation, University of Amsterdam.Google Scholar
- Wieslaw Zielonka. 1998. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. Theoretical Computer Science 200, 1-2 (1998), 135–183. Google Scholar
Digital Library
Index Terms
Fixpoint games on continuous lattices
Recommendations
On Subset Families That Form a Continuous Lattice
It is well known that continuous lattices and algebraic lattices can be respectively represented by the family of all fixed points of the projection operator and the closure operator preserving sups of directed sets on the power set of a set X. Similar ...
Residuated lattices and lattice effect algebras
Residuated lattices and lattice effect algebras arose in two rather different fields. In this paper, by introducing two partial operations in effect algebras, we investigate the mutual relationship between involutive residuated lattices and lattice ...
Q-residuated lattices and lattice pseudoeffect algebras
AbstractThe relationships among lattice pseudoeffect algebras and some partial algebraic structures with residual implications are further studied, and the main results of the previous paper (titled residuation in lattice effect algebras) are extended ...






Comments