Precongruence formats with lookahead through modal decomposition

Wan Fokkink, Rob J. van Glabbeek

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Citaten (Scopus)
7 Downloads (Pure)

Samenvatting

Bloom, Fokkink & van Glabbeek (2004) presented a method to decompose formulas from Hennessy-Milner logic with regard to a structural operational semantics specification. A term in the corresponding process algebra satisfies a Hennessy-Milner formula if and only if its subterms satisfy certain formulas, obtained by decomposing the original formula. They used this decomposition method to derive congruence formats in the realm of structural operational semantics. In this paper it is shown how this framework can be extended to specifications that include bounded lookahead in their premises. This extension is used in the derivation of a congruence format for the partial trace preorder.

Originele taal-2Engels
TitelComputer Science Logic 2017, CSL 2017
RedacteurenValentin Goranko, Mads Dam
Plaats van productieWadern
UitgeverijSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Aantal pagina's20
ISBN van elektronische versie9783959770453
DOI's
StatusGepubliceerd - 1 aug 2017
Evenement26th Annual EACSL Conference on Computer Science Logic, CSL 2017 - Stockholm, Zweden
Duur: 20 aug 201724 aug 2017

Congres

Congres26th Annual EACSL Conference on Computer Science Logic, CSL 2017
LandZweden
StadStockholm
Periode20/08/1724/08/17

Vingerafdruk

Duik in de onderzoeksthema's van 'Precongruence formats with lookahead through modal decomposition'. Samen vormen ze een unieke vingerafdruk.

Citeer dit