A finite equational base for CCS with left merge and communication merge, ACM Trans. Comput. Log, vol.10, issue.1, 2009. ,
DOI : 10.7146/brics.v13i6.21912
URL : http://arxiv.org/abs/cs/0608001
A Geometric Approach to the Problem of Unique Decomposition of Processes, LNCS, vol.6269, pp.132-146, 2010. ,
DOI : 10.1007/978-3-642-15375-4_10
URL : https://hal.archives-ouvertes.fr/hal-00527878
Branching bisimilarity is an equivalence indeed! Information Processing Letters, pp.141-147, 1996. ,
DOI : 10.1016/0020-0190(96)00034-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.7366
Distributed bisimulations, Journal of the ACM, vol.36, issue.4, pp.887-911, 1989. ,
DOI : 10.1145/76359.76369
URL : https://hal.archives-ouvertes.fr/inria-00075679
Decidability and Decomposition in Process Algebras, 1993. ,
Towards parallelization of concurrent systems, RAIRO - Theoretical Informatics and Applications, vol.32, issue.4-6, pp.4-699, 1998. ,
DOI : 10.1051/ita/1998324-600991
On Unique Decomposition of Processes in the Applied ??-Calculus, 2011. ,
DOI : 10.1007/978-3-642-37075-5_4
URL : https://hal.archives-ouvertes.fr/hal-01338002
An omega-complete equational specification of interleaving, LNCS, vol.1853, pp.729-743, 2000. ,
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences, Electronic Notes in Theoretical Computer Science, vol.239, pp.17-42, 2009. ,
DOI : 10.1016/j.entcs.2009.05.028
Branching time and abstraction in bisimulation semantics, Journal of the ACM, vol.43, issue.3, pp.555-600, 1996. ,
DOI : 10.1145/233551.233556
Verification of parallel systems via decomposition, LNCS, vol.630, pp.62-76, 1992. ,
DOI : 10.1007/BFb0084783
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.1919
Bisimulation equivalence is decidable for normed process algebra, LNCS, vol.1644, pp.412-421, 1999. ,
DOI : 10.1007/3-540-48523-6_38
Introduction to Metamathematics, 1952. ,
Unique parallel decomposition in branching and weak bisimulation semantics. CoRR, abs, 1205. ,
DOI : 10.1007/978-3-642-33475-7_18
URL : https://hal.archives-ouvertes.fr/hal-01556230
Decomposition orders?another generalisation of the fundamental theorem of arithmetic, Theoretical Computer Science, vol.335, issue.2-3, pp.147-186, 2005. ,
DOI : 10.1016/j.tcs.2004.11.019
Communication and Concurrency, 1989. ,
Operational and algebraic semantics of concurrent processes In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (B), pp.1201-1242, 1990. ,
Unique decomposition of processes, Theoretical Computer Science, vol.107, issue.2, pp.357-363, 1993. ,
DOI : 10.1016/0304-3975(93)90176-T
URL : http://doi.org/10.1016/0304-3975(93)90176-t
Axioms for Concurrency, 1989. ,
The importance of the left merge operator in process algebras, LNCS, vol.443, pp.752-764, 1990. ,
DOI : 10.1007/BFb0032072
The nonexistence of finite axiomatisations for CCS congruences, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.142-153, 1990. ,
DOI : 10.1109/LICS.1990.113741