Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation

Wan Fokkink; Rob van Glabbeek; Paulien de Wind

doi:10.1007/11804192_10

Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation

Wan Fokkink, Rob van Glabbeek, Paulien de Wind

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We present a method for decomposing modal formulas for processes with the internal action $. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method to derive congruence formats for branching and rooted branching bisimulation equivalence.

Original language	English
Title of host publication	Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures
Editors	Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf, Willem-Paul de Roever
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	195-218
Number of pages	24
ISBN (Electronic)	978-3-540-36750-5
ISBN (Print)	978-3-540-36749-9
DOIs	https://doi.org/10.1007/11804192_10
Publication status	Published - 4 Nov 2005
Event	The 4th International Symposium on Formal Methods for Components and Objects, 2005 - Amsterdam, Netherlands Duration: 1 Nov 2005 → 4 Nov 2005 Conference number: 4

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin, Heidelberg
Volume	4111
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Symposium

Symposium	The 4th International Symposium on Formal Methods for Components and Objects, 2005
Abbreviated title	FMCO 2005
Country/Territory	Netherlands
City	Amsterdam
Period	1/11/05 → 4/11/05

Access to Document

10.1007/11804192_10Licence: All Rights Reserved

https://link.springer.com/chapter/10.1007/11804192_10Licence: All Rights Reserved

Cite this

Fokkink, W., van Glabbeek, R., & de Wind, P. (2005). Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. In F. S. de Boer, M. M. Bonsangue, S. Graf, & W.-P. de Roever (Eds.), Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures (pp. 195-218). (Lecture Notes in Computer Science; Vol. 4111). Springer. https://doi.org/10.1007/11804192_10

Fokkink, Wan ; van Glabbeek, Rob ; de Wind, Paulien. / Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures. editor / Frank S. de Boer ; Marcello M. Bonsangue ; Susanne Graf ; Willem-Paul de Roever. Berlin, Heidelberg : Springer, 2005. pp. 195-218 (Lecture Notes in Computer Science).

@inproceedings{1fc675ecbffb4b5c93496b1ce6a9a101,

title = "Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation",

abstract = "We present a method for decomposing modal formulas for processes with the internal action $. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method to derive congruence formats for branching and rooted branching bisimulation equivalence.",

author = "Wan Fokkink and {van Glabbeek}, Rob and {de Wind}, Paulien",

year = "2005",

month = nov,

day = "4",

doi = "10.1007/11804192_10",

language = "English",

isbn = "978-3-540-36749-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "195--218",

editor = "{de Boer}, {Frank S.} and Bonsangue, {Marcello M.} and Susanne Graf and {de Roever}, Willem-Paul",

booktitle = "Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures",

address = "United Kingdom",

note = "The 4th International Symposium on Formal Methods for Components and Objects, 2005, FMCO 2005 ; Conference date: 01-11-2005 Through 04-11-2005",

}

Fokkink, W, van Glabbeek, R & de Wind, P 2005, Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. in FS de Boer, MM Bonsangue, S Graf & W-P de Roever (eds), Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures. Lecture Notes in Computer Science, vol. 4111, Springer, Berlin, Heidelberg, pp. 195-218, The 4th International Symposium on Formal Methods for Components and Objects, 2005, Amsterdam, Netherlands, 1/11/05. https://doi.org/10.1007/11804192_10

Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. / Fokkink, Wan; van Glabbeek, Rob; de Wind, Paulien.
Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures. ed. / Frank S. de Boer; Marcello M. Bonsangue; Susanne Graf; Willem-Paul de Roever. Berlin, Heidelberg: Springer, 2005. p. 195-218 (Lecture Notes in Computer Science; Vol. 4111).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation

AU - Fokkink, Wan

AU - van Glabbeek, Rob

AU - de Wind, Paulien

N1 - Conference code: 4

PY - 2005/11/4

Y1 - 2005/11/4

N2 - We present a method for decomposing modal formulas for processes with the internal action $. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method to derive congruence formats for branching and rooted branching bisimulation equivalence.

AB - We present a method for decomposing modal formulas for processes with the internal action $. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method to derive congruence formats for branching and rooted branching bisimulation equivalence.

U2 - 10.1007/11804192_10

DO - 10.1007/11804192_10

M3 - Conference contribution

SN - 978-3-540-36749-9

T3 - Lecture Notes in Computer Science

SP - 195

EP - 218

BT - Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures

A2 - de Boer, Frank S.

A2 - Bonsangue, Marcello M.

A2 - Graf, Susanne

A2 - de Roever, Willem-Paul

PB - Springer

CY - Berlin, Heidelberg

T2 - The 4th International Symposium on Formal Methods for Components and Objects, 2005

Y2 - 1 November 2005 through 4 November 2005

ER -

Fokkink W, van Glabbeek R, de Wind P. Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. In de Boer FS, Bonsangue MM, Graf S, de Roever WP, editors, Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures. Berlin, Heidelberg: Springer. 2005. p. 195-218. (Lecture Notes in Computer Science). doi: 10.1007/11804192_10

Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation

Abstract

Publication series

Symposium

Access to Document

Fingerprint

Cite this