Abstract / Description of output
Earlier we presented a method to decompose modal formulas for processes with the internal action τ; congruence formats for branching and η-bisimilarity were derived on the basis of this decomposition method. The idea is that a congruence format for a semantics must ensure that formulas in the modal characterisation of this semantics are always decomposed into formulas in this modal characterisation. Here the decomposition method is enhanced to deal with modal characterisations that contain a modality 〈ϵ〉〈a〉φ, to derive congruence formats for delay and weak bisimilarity.
Original language | English |
---|---|
Title of host publication | Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science |
Place of Publication | New York, NY, USA |
Publisher | Association for Computing Machinery, Inc |
Pages | 778–787 |
Number of pages | 10 |
ISBN (Electronic) | 9781450343916 |
DOIs | |
Publication status | Published - 5 Jul 2016 |
Event | 31st Annual ACM/IEEE Symposium on Logic in Computer Science - New York City, United States Duration: 5 Jul 2016 → 8 Jul 2016 http://lics.siglog.org/lics16/ |
Publication series
Name | LICS '16 |
---|---|
Publisher | Association for Computing Machinery |
Conference
Conference | 31st Annual ACM/IEEE Symposium on Logic in Computer Science |
---|---|
Abbreviated title | LICS 2016 |
Country/Territory | United States |
City | New York City |
Period | 5/07/16 → 8/07/16 |
Internet address |