Unique parallel decomposition in branching and weak bisimulation semantics

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

Abstract

We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that totally normed behaviours always have parallel decompositions, but that these are not necessarily unique. Then, we establish that finite behaviours have unique parallel decompositions. We derive the latter result from a general theorem about unique decompositions in partial commutative monoids.
Original languageEnglish
Title of host publicationTheoretical Computer Science (7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings)
EditorsJ.C.M. Baeten, T. Ball, F.S. Boer, de
Place of PublicationBerlin
PublisherSpringer
Pages250-264
ISBN (Print)978-3-642-33474-0
DOIs
Publication statusPublished - 2012
Event7th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science; 2012-09-26; 2012-09-28 -
Duration: 26 Sep 201228 Sep 2012

Publication series

NameLecture Notes in Computer Science
Volume7604
ISSN (Print)0302-9743

Conference

Conference7th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science; 2012-09-26; 2012-09-28
Period26/09/1228/09/12
Other7th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science

Fingerprint Dive into the research topics of 'Unique parallel decomposition in branching and weak bisimulation semantics'. Together they form a unique fingerprint.

Cite this