Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics - Theoretical Computer Science Access content directly
Conference Papers Year : 2012

Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics

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.
Fichier principal
Vignette du fichier
978-3-642-33475-7_18_Chapter.pdf (303.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01556230 , version 1 (04-07-2017)

Licence

Attribution

Identifiers

Cite

Bas Luttik. Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.250-264, ⟨10.1007/978-3-642-33475-7_18⟩. ⟨hal-01556230⟩
153 View
52 Download

Altmetric

Share

Gmail Facebook X LinkedIn More