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 language | English |
---|---|
Title of host publication | Computer Science Logic 2017, CSL 2017 |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Volume | 82 |
ISBN (Electronic) | 9783959770453 |
DOIs | |
Publication status | Published - 1 Aug 2017 |
Event | 26th Annual EACSL Conference on Computer Science Logic, CSL 2017 - Stockholm, Sweden Duration: 20 Aug 2017 → 24 Aug 2017 |
Conference
Conference | 26th Annual EACSL Conference on Computer Science Logic, CSL 2017 |
---|---|
Country/Territory | Sweden |
City | Stockholm |
Period | 20/08/17 → 24/08/17 |
Keywords
- Compositionality
- Congruence
- Lookahead
- Modal Decomposition
- Modal Logic
- Structural Operational Semantics