Consistent correlations for parameterised Boolean equation systems with applications in correctness proofs for manipulations

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

8 Citaten (Scopus)
1 Downloads (Pure)

Samenvatting

We introduce the concept of consistent correlations for parameterised Boolean equation systems (PBESs), motivated largely by the laborious proofs of correctness required for most manipulations in this setting. Consistent correlations focus on relating the equations that occur in PBESs, rather than their solutions. For a fragment of PBESs, consistent correlations are shown to coincide with a recently introduced form of bisimulation. Finally, we show that bisimilarity on processes induces consistent correlations on PBESs encoding model checking problems. We apply our theory to two example manipulations from the literature.
Originele taal-2Engels
TitelCONCUR 2010 - Concurrency Theory (21st International Conference, Paris, France, August 31-September 3, 2010. Proceedings)
RedacteurenP. Gastin, F. Laroussinie
Plaats van productieBerlin
UitgeverijSpringer
Pagina's584-598
ISBN van geprinte versie978-3-642-15374-7
DOI's
StatusGepubliceerd - 2010

Publicatie series

NaamLecture Notes in Computer Science
Volume6269
ISSN van geprinte versie0302-9743

Vingerafdruk

Duik in de onderzoeksthema's van 'Consistent correlations for parameterised Boolean equation systems with applications in correctness proofs for manipulations'. Samen vormen ze een unieke vingerafdruk.

Citeer dit