Precongruence formats with lookahead through modal decomposition

Wan Fokkink, Rob J. Van Glabbeek

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

Abstract

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.

Original languageEnglish
Title of host publication26th EACSL Annual Conference on Computer Science Logic (CSL 2017)
Subtitle of host publication[Proceedings]
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages1-20
Number of pages20
ISBN (Electronic)9783959770453
DOIs
Publication statusPublished - 2017
Event26th Annual EACSL Conference on Computer Science Logic, CSL 2017 - Stockholm, Sweden
Duration: 20 Aug 201724 Aug 2017

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume82

Conference

Conference26th Annual EACSL Conference on Computer Science Logic, CSL 2017
Country/TerritorySweden
CityStockholm
Period20/08/1724/08/17

Keywords

  • Compositionality
  • Congruence
  • Lookahead
  • Modal Decomposition
  • Modal Logic
  • Structural Operational Semantics

Fingerprint

Dive into the research topics of 'Precongruence formats with lookahead through modal decomposition'. Together they form a unique fingerprint.

Cite this