Solving parameterised boolean equation systems with infinite data through quotienting

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)
2 Downloads (Pure)

Abstract

Parameterised Boolean Equation Systems (PBESs) can be used to represent many different kinds of decision problems. Most notably, model checking and equivalence problems can be encoded in a PBES. Traditional instantiation techniques cannot deal with PBESs with an infinite data domain. We propose an approach that can solve PBESs with infinite data by computing the bisimulation quotient of the underlying graph structure. Furthermore, we show how this technique can be improved by repeatedly searching for finite proofs. Unlike existing approaches, our technique is not restricted to subfragments of PBESs. Experimental results show that our ideas work well in practice and support a wider range of models and properties than state-of-the-art techniques.

Original languageEnglish
Title of host publicationFormal Aspects of Component Software - 15th International Conference, FACS 2018, Proceedings
EditorsPeter Csaba Ölveczky, Kyungmin Bae
Place of PublicationBerlin
PublisherSpringer
Pages216-236
Number of pages21
ISBN (Electronic)978-3-030-02146-7
ISBN (Print)978-3-030-02145-0
DOIs
Publication statusPublished - 5 Oct 2018
Event15th International Conference on Formal Aspects of Component Software, FACS 2018 - Pohang, Korea, Republic of
Duration: 10 Oct 201812 Oct 2018

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11222

Conference

Conference15th International Conference on Formal Aspects of Component Software, FACS 2018
CountryKorea, Republic of
CityPohang
Period10/10/1812/10/18

    Fingerprint

Cite this

Neele, T., Willemse, T. A. C., & Groote, J. F. (2018). Solving parameterised boolean equation systems with infinite data through quotienting. In P. C. Ölveczky, & K. Bae (Eds.), Formal Aspects of Component Software - 15th International Conference, FACS 2018, Proceedings (pp. 216-236). (Lecture Notes in Computer Science; Vol. 11222). Berlin: Springer. https://doi.org/10.1007/978-3-030-02146-7_11