Solving parameterised boolean equation systems with infinite data through quotienting

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

7 Citaten (Scopus)
2 Downloads (Pure)

Samenvatting

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.

Originele taal-2Engels
TitelFormal Aspects of Component Software - 15th International Conference, FACS 2018, Proceedings
RedacteurenPeter Csaba Ölveczky, Kyungmin Bae
Plaats van productieBerlin
UitgeverijSpringer
Pagina's216-236
Aantal pagina's21
ISBN van elektronische versie978-3-030-02146-7
ISBN van geprinte versie978-3-030-02145-0
DOI's
StatusGepubliceerd - 5 okt. 2018
Evenement15th International Conference on Formal Aspects of Component Software, FACS 2018 - Pohang, Zuid-Korea
Duur: 10 okt. 201812 okt. 2018

Publicatie series

NaamLecture Notes in Computer Science
UitgeverijSpringer
Volume11222

Congres

Congres15th International Conference on Formal Aspects of Component Software, FACS 2018
Land/RegioZuid-Korea
StadPohang
Periode10/10/1812/10/18

Vingerafdruk

Duik in de onderzoeksthema's van 'Solving parameterised boolean equation systems with infinite data through quotienting'. Samen vormen ze een unieke vingerafdruk.

Citeer dit