Divide and congruence II: delay and weak bisimilarity

W. Fokkink; R. van Glabbeek

doi:10.1145/2933575.2933590

Divide and congruence II: delay and weak bisimilarity

W. Fokkink, R. van Glabbeek

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

10 Citations (Scopus)

Abstract

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, LICS 2016
Place of Publication	New York
Publisher	Association for Computing Machinery, Inc
Pages	778-787
Number of pages	10
ISBN (Electronic)	978-1-4503-4391-6
DOIs	https://doi.org/10.1145/2933575.2933590
Publication status	Published - 5 Jul 2016
Externally published	Yes
Event	31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016) - New York, United States Duration: 5 Jul 2016 → 8 Jul 2016 Conference number: 31

Conference

Conference	31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016)
Abbreviated title	LICS 2016
Country/Territory	United States
City	New York
Period	5/07/16 → 8/07/16

Access to Document

10.1145/2933575.2933590

Cite this

@inproceedings{29ec3981de5e49adaa01fe1f3c53d5e8,

title = "Divide and congruence II: delay and weak bisimilarity",

abstract = "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.",

author = "W. Fokkink and {van Glabbeek}, R.",

year = "2016",

month = jul,

day = "5",

doi = "10.1145/2933575.2933590",

language = "English",

pages = "778--787",

booktitle = "Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016",

publisher = "Association for Computing Machinery, Inc",

address = "United States",

note = "31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016), LICS 2016 ; Conference date: 05-07-2016 Through 08-07-2016",

}

Fokkink, W & van Glabbeek, R 2016, Divide and congruence II: delay and weak bisimilarity. in Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016. Association for Computing Machinery, Inc, New York, pp. 778-787, 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016), New York, New York, United States, 5/07/16. https://doi.org/10.1145/2933575.2933590

TY - GEN

T1 - Divide and congruence II

T2 - 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016)

AU - Fokkink, W.

AU - van Glabbeek, R.

N1 - Conference code: 31

PY - 2016/7/5

Y1 - 2016/7/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84994559015&partnerID=8YFLogxK

U2 - 10.1145/2933575.2933590

DO - 10.1145/2933575.2933590

M3 - Conference contribution

AN - SCOPUS:84994559015

SP - 778

EP - 787

BT - Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016

PB - Association for Computing Machinery, Inc

CY - New York

Y2 - 5 July 2016 through 8 July 2016

ER -

Divide and congruence II: delay and weak bisimilarity

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this