Unique parallel decomposition in branching and weak bisimulation semantics
Output:
Contribution to journal
Article
Academic
Peer-reviewInformation
Output type
Output:
Contribution to journal
Article
Academic
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 29-44Journal (Volume, Issue Number)
Theoretical Computer Science (Volume 612)Publication milestones
- Published - 2016
Publication status
Published - 2016
ISSN
0304-3975Abstract
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that 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.
Documents and Links
Metrics
Metrics
Scopus
citations
11
SciVal
FWCI
0.68
SciVal
Author count
1
SciVal
Paper percentile
61
SciVal
citations
11
PlumX, opens in new tab
Citation count
11
Captures
3
