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 proceedingConference contribution

Abstract / Description of output

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 languageEnglish
Title of host publicationFormal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures
EditorsFrank S. de Boer, Marcello M. Bonsangue, Susanne Graf, Willem-Paul de Roever
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Pages195-218
Number of pages24
ISBN (Electronic)978-3-540-36750-5
ISBN (Print)978-3-540-36749-9
DOIs
Publication statusPublished - 4 Nov 2005
EventThe 4th International Symposium on Formal Methods for Components and Objects, 2005 - Amsterdam, Netherlands
Duration: 1 Nov 20054 Nov 2005
Conference number: 4

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin, Heidelberg
Volume4111
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Symposium

SymposiumThe 4th International Symposium on Formal Methods for Components and Objects, 2005
Abbreviated titleFMCO 2005
Country/TerritoryNetherlands
CityAmsterdam
Period1/11/054/11/05

Fingerprint

Dive into the research topics of 'Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation'. Together they form a unique fingerprint.

Cite this