Abstract
In the context of formal verification in general and model checking in particular, parity games serve as a mighty vehicle: many problems are encoded as parity games, which are then solved by the seminal algorithm by Jurdzinski. In this paper we identify the essence of this workflow to be the notion of progress measure, and formalize it in general, possibly infinitary, lattice-theoretic terms. Our view on progress measures is that they are to nested/alternating fixed points what invariants are to safety/greatest fixed points, and what ranking functions are to liveness/least fixed points. That is, progress measures are combination of the latter two notions (invariant and ranking function) that have been extensively studied in the context of (program) verification. We then apply our theory of progress measures to a general model-checking framework, where systems are categorically presented as coalgebras. The framework's theoretical robustness is witnessed by a smooth transfer from the branching-time setting to the linear-time one. Although the framework can be used to derive some decision procedures for finite settings, we also expect the proposed framework to form a basis for sound proof methods for some undecidable/infinitary problems.
- S. Almagor, U. Boker, and O. Kupferman. Formalizing and reasoning about quality. In F. V. Fomin, R. Freivalds, M. Z. Kwiatkowska, and D. Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, volume 7966 of Lecture Notes in Computer Science, pages 15–27. Springer, 2013. Google Scholar
Digital Library
- A. Arnold and D. Niwi´nski. Rudiments of µ-Calculus. Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam, 2001.Google Scholar
- S. Awodey. Category Theory. Oxford Logic Guides. Oxford Univ. Press, 2006. Google Scholar
Digital Library
- F. Bartels. On generalised coinduction and probabilistic specification formats. Distributive laws in coalgebraic modelling. PhD thesis, Free Univ. Amsterdam, 2004.Google Scholar
- A. M. Ben-Amram and S. Genaim. Complexity of Bradley-Manna-Sipma lexicographic ranking functions. In D. Kroening and C. S. Pasareanu, editors, Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II, volume 9207 of Lecture Notes in Computer Science, pages 304–321. Springer, 2015.Google Scholar
- M. M. Bonsangue and A. Kurz. Duality for logics of transition systems. In V. Sassone, editor, FoSSaCS, volume 3441 of Lect. Notes Comp. Sci., pages 455–469. Springer, 2005. Google Scholar
Digital Library
- J. Bradfield and C. Stirling. Modal mu-calculi. In P. Blackburn, J. van Benthem, and F. Wolter, editors, Handbook of Modal Logic, volume 3 of Studies in Logic and Practical Reasoning, chapter 12. Elsevier, 2006.Google Scholar
- K. Chatterjee and L. Doyen. Energy parity games. Theor. Comput. Sci., 458:49–60, 2012. Google Scholar
Digital Library
- K. Chatterjee, M. Jurdzinski, and T. A. Henzinger. Quantitative stochastic parity games. In J. I. Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pages 121– 130. SIAM, 2004. Google Scholar
Digital Library
- B. F. Chellas. Modal Logic. Cambridge University Press, 1980.Google Scholar
- C. Cˆırstea. Maximal traces and path-based coalgebraic temporal logics. Theor. Comput. Sci., 412(38):5025–5042, 2011. Google Scholar
Digital Library
- C. Cˆırstea. Model checking linear coalgebraic temporal logics: An automata-theoretic approach. In A. Corradini, B. Klin, and C. Cˆırstea, editors, Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011, Winchester, UK, August 30 - September 2, 2011. Proceedings, volume 6859 of Lecture Notes in Computer Science, pages 130–144. Springer, 2011. Google Scholar
Digital Library
- C. Cˆırstea. A coalgebraic approach to linear-time logics. In MuschollGoogle Scholar
- , pages 426–440.Google Scholar
- C. Cˆırstea. Canonical coalgebraic linear time logics. In Proc. 6th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015. To appear.Google Scholar
- C. Cˆırstea and D. Pattinson. Modular construction of complete coalgebraic logics. Theor. Comput. Sci., 388(1-3):83–108, 2007. Google Scholar
Digital Library
- C. Cˆırstea, C. Kupke, and D. Pattinson. EXPTIME tableaux for the coalgebraic µ-calculus. In E. Grädel and R. Kahle, editors, CSL, volume 5771 of Lecture Notes in Computer Science, pages 179–193. Springer, 2009. Google Scholar
Digital Library
- C. Cˆırstea, A. Kurz, D. Pattinson, L. Schröder, and Y. Venema. Modal logics are coalgebraic. Comput. J., 54(1):31–41, 2011. Google Scholar
Digital Library
- R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. Formal Methods in System Design, 2(2):121–147, 1993. Google Scholar
Digital Library
- R. Cleaveland, M. Klein, and B. Steffen. Faster model checking for the modal mu-calculus. In G. von Bochmann and D. K. Probst, editors, Computer Aided Verification, Fourth International Workshop, CAV ’92, Montreal, Canada, June 29 - July 1, 1992, Proceedings, volume 663 of Lecture Notes in Computer Science, pages 410–422. Springer, 1992. Google Scholar
Digital Library
- P. Cousot and R. Cousot. Constructive versions of Tarski’s fixed point theorems. Pacific Journal of Mathematics, 82(1):43–57, 1979.Google Scholar
Cross Ref
- L. de Alfaro, T. A. Henzinger, and R. Majumdar. Discounting the future in systems theory. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, editors, Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, volume 2719 of Lect. Notes Comp. Sci., pages 1022–1037. Springer, 2003. Google Scholar
Digital Library
- K. Etessami, T. Wilke, and R. A. Schuller. Fair simulation relations, parity games, and state space reduction for büchi automata. SIAM J. Comput., 34(5):1159–1175, 2005. Google Scholar
Digital Library
- K. Fine. In so many possible worlds. Notre Dame J. Formal Logic, 13:516–520, 1972.Google Scholar
Cross Ref
- G. Fontaine, R. A. Leal, and Y. Venema. Automata for coalgebras: An approach using predicate liftings. In S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, editors, ICALP (2), volume 6199 of Lecture Notes in Computer Science, pages 381– 392. Springer, 2010. Google Scholar
Digital Library
- P. Garg, C. Löding, P. Madhusudan, and D. Neider. ICE: A robust framework for learning invariants. In A. Biere and R. Bloem, editors, Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings, volume 8559 of Lecture Notes in Computer Science, pages 69–87. Springer, 2014. Google Scholar
Digital Library
- I. Hasuo, B. Jacobs, and A. Sokolova. Generic trace semantics via coinduction. Logical Methods in Comp. Sci., 3(4:11), 2007.Google Scholar
- I. Hasuo, S. Shimizu, and C. Cˆırstea. Lattice-theoretic progress measures and coalgebraic model checking. Extended version with appendices, available at http://arxiv.org/, 2015.Google Scholar
- C. Hermida and B. Jacobs. Structural induction and coinduction in a fibrational setting. Inf. & Comp., 145:107––152, 1998. Google Scholar
Digital Library
- B. Jacobs. The temporal logic of coalgebras via Galois algebras. Math. Struct. in Comp. Sci., 12:875–903, 2002. Google Scholar
Digital Library
- B. Jacobs. Trace semantics for coalgebras. In J. Adámek and S. Milius, editors, Coalgebraic Methods in Computer Science, volume 106 of Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2004. Google Scholar
Digital Library
- B. Jacobs. Introduction to coalgebra. Towards mathematics of states and observations. Draft of a book (ver. 2.0), available online, 2012.Google Scholar
- B. Jacobs, A. Silva, and A. Sokolova. Trace semantics via determinization. J. Comput. Syst. Sci., 81(5):859–879, 2015.Google Scholar
Digital Library
- M. Jurdzinski. Small progress measures for solving parity games. In H. Reichel and S. Tison, editors, STACS, volume 1770 of Lecture Notes in Computer Science, pages 290–301. Springer, 2000. Google Scholar
Digital Library
- H. Kerstan and B. König. Coalgebraic trace semantics for continuous probabilistic transition systems. Logical Methods in Computer Science, 9(4), 2013.Google Scholar
- N. Klarlund and D. Kozen. Rabin measures and their applications to fairness and automata theory. In Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS ’91), Amsterdam, The Netherlands, July 15-18, 1991, pages 256–265. IEEE Computer Society, 1991.Google Scholar
Cross Ref
- B. Klin. Coalgebraic modal logic beyond Sets. In MFPS XXIII, volume 173, pages 177–201. Elsevier, Amsterdam, 2007. Google Scholar
Digital Library
- N. Kobayashi and C.-H. L. Ong. A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In LICS, pages 179–188. IEEE Computer Society, 2009. Google Scholar
Digital Library
- D. Kozen. Results on the propositional µ-calculus. Theor. Comp. Sci., 27(3):333–354, 1983.Google Scholar
Cross Ref
- S. Mac Lane. Categories for the Working Mathematician. Springer, Berlin, 2nd edition, 1998.Google Scholar
- M. Mio. Upper-expectation bisimilarity and Łukasiewicz µ-calculus. In Muscholl {42}, pages 335–350.Google Scholar
- L. S. Moss. Coalgebraic logic. Ann. Pure & Appl. Logic, 96(1-3): 277––317, 1999. Erratum in Ann. Pure & Appl. Logic, 99(1-3):241–– 259, 1999.Google Scholar
Cross Ref
- A. Muscholl, editor. Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, volume 8412 of Lecture Notes in Computer Science, 2014.Google Scholar
- Springer.Google Scholar
- S. Nakagawa and I. Hasuo. Near-optimal scheduling for LTL with future discounting. In Trustworthy Global Computing - 10th International Symposium, TGC 2015, Lecture Notes in Computer Science. Springer, 2015. to appear.Google Scholar
- C. L. Ong. On model-checking trees generated by higher-order recursion schemes. In 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings, pages 81–90. IEEE Computer Society, 2006. Google Scholar
Digital Library
- D. Pattinson. Coalgebraic modal logic: soundness, completeness and decidability of local consequence. Theor. Comput. Sci., 309(1-3):177– 193, 2003. Google Scholar
Digital Library
- D. Pattinson. The logic of exact covers: Completeness and uniform interpolation. In 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013, pages 418–427. IEEE Computer Society, 2013. Google Scholar
Digital Library
- D. Pattinson and L. Schröder. Admissibility of cut in coalgebraic logics. Electr. Notes Theor. Comput. Sci., 203(5):221–241, 2008. Google Scholar
Digital Library
- M. Pauly. A modal logic for coalitional power in games. J. Logic Comput., 12(1):149–166, 2002.Google Scholar
Cross Ref
- A. Pnueli. The temporal logic of programs. In Found. Comp. Sci., pages 46–57. IEEE, 1977. Google Scholar
Digital Library
- J. Power and D. Turi. A coalgebraic foundation for linear time semantics. In Category Theory and Computer Science, volume 29 of Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1999.Google Scholar
- J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Theor. Comp. Sci., 249:3–80, 2000. Google Scholar
Digital Library
- L. Schröder and D. Pattinson. Pspace bounds for rank-1 modal logics. ACM Trans. Comput. Log., 10(2), 2009. Google Scholar
Digital Library
- L. Schröder and Y. Venema. Flat coalgebraic fixed point logics. In P. Gastin and F. Laroussinie, editors, CONCUR, volume 6269 of Lect. Notes Comp. Sci., pages 524–538. Springer, 2010.Google Scholar
- T. Tsukada and C. L. Ong. Compositional higher-order model checking via ω-regular games over böhm trees. In T. A. Henzinger and D. Miller, editors, Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS ’14, Vienna, Austria, July 14 - 18, 2014, pages 78:1–78:10. ACM, 2014. Google Scholar
Digital Library
- N. Urabe and I. Hasuo. Generic forward and backward simulations III: quantitative simulations by matrices. In P. Baldan and D. Gorla, editors, CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings, volume 8704 of Lecture Notes in Computer Science, pages 451–466. Springer, 2014. Best paper award.Google Scholar
Cross Ref
- N. Urabe and I. Hasuo. Coalgebraic infinite traces and Kleisli simulations. In Proc. 6th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), Leibniz International Proceedings in Informatics, 2015. To appear; extended version available at http://arxiv.org/abs/1505.06819.Google Scholar
- M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. M. Birtwistle, editors, Banff Higher Order Workshop, volume 1043 of Lecture Notes in Computer Science, pages 238–266. Springer, 1995. Google Scholar
Digital Library
- Y. Venema. Automata and fixed point logic: A coalgebraic perspective. Inf. Comput., 204(4):637–678, 2006. Google Scholar
Digital Library
- T. Wilke. Alternating tree automata, parity games, and modal µcalculus. Bull. Belg. Math. Soc. Simon Stevin, 8(2):359–391, 2001.Google Scholar
Cross Ref
Index Terms
Lattice-theoretic progress measures and coalgebraic model checking
Recommendations
Lattice-theoretic progress measures and coalgebraic model checking
POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesIn the context of formal verification in general and model checking in particular, parity games serve as a mighty vehicle: many problems are encoded as parity games, which are then solved by the seminal algorithm by Jurdzinski. In this paper we ...
Model checking linear coalgebraic temporal logics: an automata-theoretic approach
CALCO'11: Proceedings of the 4th international conference on Algebra and coalgebra in computer scienceWe extend the theory of maximal traces of pointed nondeterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras. We then consider linear coalgebraic temporal logics interpreted over ...
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This paper makes two contributions. First, a previous result characterizing ...






Comments