Skip to main content
NCBI home page
Springer Nature - PMC COVID-19 Collection logoLink to Springer Nature - PMC COVID-19 Collection
. 2020 Mar 13;12079:307–324. doi: 10.1007/978-3-030-45237-7_19

Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems

Thomas Neele ‡,✉, Tim A C Willemse ‡, Wieger Wesselink ‡
Editors: Armin Biere8, David Parker9
PMCID: PMC7480682

Abstract

Partial-order reduction (POR) is a well-established technique to combat the problem of state-space explosion. We propose POR techniques that are sound for parity games, a well-established formalism for solving a variety of decision problems. As a consequence, we obtain the first POR method that is sound for model checking for the full modal Inline graphic-calculus. Our technique is applied to, and implemented for the fixed point logic called parameterised Boolean equation systems, which provides a high-level representation of parity games. Experiments indicate that substantial reductions can be achieved.

Contributor Information

Armin Biere, Email: biere@jku.at.

David Parker, Email: d.a.parker@cs.bham.ac.uk.

Thomas Neele, Email: t.s.neele@tue.nl.

Tim A. C. Willemse, Email: t.a.c.willemse@tue.nl

Wieger Wesselink, Email: j.w.wesselink@tue.nl.

References

  • 1.Anderson TE. The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors. IEEE Transactions on Parallel & Distributed Systems. 1990;1(1):6–16. [Google Scholar]
  • 2.Baier, C., Katoen, J.P.: Principles of model checking. MIT Press (2008)
  • 3.Bønneland, F.M., Jensen, P.G., Larsen, K.G., Muñiz, M.: Partial Order Reduction for Reachability Games. In: CONCUR 2019. vol. 140, pp. 23:1–23:15 (2019). 10.4230/LIPIcs.CONCUR.2019.23
  • 4.Bønneland, F.M., Jensen, P.G., Larsen, K.G., Mũniz, M., Srba, J.: Stubborn Set Reduction for Two-Player Reachability Games. arXiv:1912.09875 (2019)
  • 5.Bunte, O., Groote, J.F., Keiren, J.J.A., Laveaux, M., Neele, T., de Vink, E.P., Wesselink, J.W., Wijs, A.W., Willemse, T.A.C.: The mCRL2 Toolset for Analysing Concurrent Systems: Improvements in Expressivity and Usability. In: TACAS 2019. LNCS, vol. 11428, pp. 21–39 (2019). 10.1007/978-3-030-17465-1_2
  • 6.Cranen, S., Luttik, B., Willemse, T.A.C.: Proof graphs for parameterised Boolean equation systems. In: CONCUR 2013. LNCS, vol. 8052, pp. 470–484 (2013). 10.1007/978-3-642-40184-8_33
  • 7.Gerth R, Kuiper R, Peled D, Penczek W. A Partial Order Approach to Branching Time Logic Model Checking. Information and Computation. 1999;150(2):132–152. [Google Scholar]
  • 8.Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems, LNCS, vol. 1032. Springer (1996). 10.1007/3-540-60761-7
  • 9.Groote, J.F., Sellink, M.P.A.: Confluence for process verification. Theoretical Computer Science 170(1-2), 47–81 (1996). 10.1016/s0304-3975(96)00175-2
  • 10.Groote JF, Willemse TAC. Parameterised boolean equation systems. Theoretical Computer Science. 2005;343(3):332–369. [Google Scholar]
  • 11.Heimbold D, Luckham D. Debugging ada tasking programs. IEEE Software. 1985;2(2):47–57. [Google Scholar]
  • 12.Hesselink WH. Invariants for the construction of a handshake register. Inf. Process. Lett. 1998;68(4):173–177. [Google Scholar]
  • 13.Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods in System Design 9(1-2), 41–75 (1996). 10.1007/BF00625968
  • 14.Kan S, Huang Z, Chen Z, Li W, Huang Y. Partial order reduction for checking LTL formulae with the next-time operator. Journal of Logic and Computation. 2017;27(4):1095–1131. [Google Scholar]
  • 15.Keiren, J.J.A., Wesselink, J.W., Willemse, T.A.C.: Liveness Analysis for Parameterised Boolean Equation Systems. In: ATVA 2014. LNCS, vol. 8837, pp. 219–234 (2014). 10.1007/978-3-319-11936-6_16
  • 16.Kozen D. Results on the propositional Inline graphic-calculus. Theoretical Computer Science. 1982;27(3):333–354. [Google Scholar]
  • 17.Laarman, A., Pater, E., van de Pol, J., Hansen, H.: Guard-based partial-order reduction. STTT 18(4), 427–448 (2016). 10.1007/s10009-014-0363-9
  • 18.Lann GL. Distributed systems - towards a formal approach. IFIP. 1977;1977:155–160. [Google Scholar]
  • 19.Liebke, T., Wolf, K.: Taking Some Burden Off an Explicit CTL Model Checker. In: Petri Nets 2019. LNCS, vol. 11522, pp. 321–341 (2019). 10.1007/978-3-030-21571-2_18
  • 20.Milner, R.: A Calculus of Communicating Systems, LNCS, vol. 92. Springer (1980)
  • 21.Neele, T., Valmari, A., Willemse, T.A.C.: The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. In: FoSSaCS 2020. LNCS, vol. 2077 (2020). 10.1007/978-3-030-45231-5_25
  • 22.Neele, T., Willemse, T.A.C., Groote, J.F.: Solving Parameterised Boolean Equation Systems with Infinite Data Through Quotienting. In: FACS 2018. LNCS, vol. 11222, pp. 216–236 (2018). 10.1007/978-3-030-02146-7_11
  • 23.Neele T, Willemse TAC, Groote JF. Finding compact proofs for infinite-data parameterised Boolean equation systems. Science of Computer Programming. 2020;188:102389. [Google Scholar]
  • 24.Neele, T., Willemse, T.A.C., Wesselink, W.: Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems (Technical Report). Tech. rep., Eindhoven University of Technology (2019)
  • 25.Pelánek, R.: BEEM: Benchmarks for Explicit Model Checkers. In: SPIN 2007. LNCS, vol. 4595, pp. 263–267 (2007). 10.1007/978-3-540-73370-6_17
  • 26.Peled, D.: All from One, One for All: on Model Checking Using Representatives. In: CAV 1993. LNCS, vol. 697, pp. 409–423 (1993). 10.1007/3-540-56922-7_34
  • 27.Peled D. Combining partial order reductions with on-the-fly model-checking. FMSD. 1996;8(1):39–64. [Google Scholar]
  • 28.Ramakrishna, Y.S., Smolka, S.A.: Partial-Order Reduction in the Weak Modal Mu-Calculus. In: CONCUR 1997. LNCS, vol. 1243, pp. 5–24 (1997). 10.1007/3-540-63141-0_2
  • 29.Siegel, S.F.: What’s Wrong with On-the-Fly Partial Order Reduction. In: CAV 2019. LNCS, vol. 11562, pp. 478–495 (2019). 10.1007/978-3-030-25543-5_27
  • 30.Valmari A. A Stubborn Attack on State Explosion. Formal Methods in System Design. 1992;1(4):297–322. [Google Scholar]
  • 31.Valmari, A.: The state explosion problem. In: ACPN 1996. LNCS, vol. 1491, pp. 429–528 (1996). 10.1007/3-540-65306-6_21
  • 32.Valmari, A.: Stubborn Set Methods for Process Algebras. In: POMIV 1996. DIMACS, vol. 29, pp. 213–231 (1997). 10.1090/dimacs/029/12
  • 33.Valmari A, Hansen H. Stubborn Set Intuition Explained. ToPNoC. 2017;10470(12):140–165. [Google Scholar]

Articles from Tools and Algorithms for the Construction and Analysis of Systems are provided here courtesy of Nature Publishing Group

RESOURCES