L. Aceto, W. Fokkink, A. Ingólfsdóttir & B. Luttik (2005):
CCS with Hennessy's merge has no finite-equational axiomatization.
Theor. Comput. Sci. 330(3),
pp. 377–405,
doi:10.1016/j.tcs.2004.10.003.
L. Aceto, W. Fokkink, A. Ingólfsdóttir & B.. Luttik (2009):
A finite equational base for CCS with left merge and communication merge.
ACM Trans. Comput. Log. 10(1),
doi:10.1145/1459010.1459016.
L. Aceto, A. Ingólfsdóttir, B. Luttik & P. van Tilburg (2008):
Finite Equational Bases for Fragments of CCS with Restriction and Relabelling.
In: IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science,
pp. 317–332,
doi:10.1007/978-0-387-09680-3_22.
I. Castellani (1998):
Bisimulations for Concurrency.
University of Edinburgh.
Also published as LFCS-88-51.
S. Christensen (1993):
Decidability and Decomposition in Process Algebra.
University of Edinburgh.
F. Corradini, R. Gorrieri & D. Marchignoli (1998):
Towards parallelization of concurrent systems.
Informatique théorique et applications 32(4-6),
pp. 99–125.
J. Dreier, C. Ene, P. Lafourcade & Y. Lakhnech (2016):
On the existence and decidability of unique decompositions of processes in the applied π-calculus.
Theor. Comput. Sci. 612,
pp. 102–125,
doi:10.1016/j.tcs.2015.11.033.
J. Dreier, P. Lafourcade & Y. Lakhnech (2012):
Defining Privacy for Weighted Votes, Single and Multi-voter Coercion.
In: ESORICS 2012,
pp. 451–468,
doi:10.1007/978-3-642-33167-1_26.
W. Fokkink & B. Luttik (2000):
An omega-Complete Equational Specification of Interleaving.
In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000,
pp. 729–743,
doi:10.1007/3-540-45022-X_61.
J. Friso Groote & F. Moller (1992):
Verification of Parallel Systems via Decomposition.
In: CONCUR '92, Third International Conference on Concurrency Theory,
pp. 62–76,
doi:10.1007/BFb0084783.
D. Hirschkoff & D. Pous (2008):
A Distribution Law for CCS and a New Congruence Result for the π-calculus.
Logical Methods in Computer Science 4(2),
doi:10.2168/LMCS-4(2:4)2008.
Y. Hirshfeld & M. Jerrum (1999):
Bisimulation Equivalence Is Decidable for Normed Process Algebra.
In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99,
pp. 412–421,
doi:10.1007/3-540-48523-6_38.
I. Lanese, J. A. Pérez, D. Sangiorgi & A. Schmitt (2011):
On the expressiveness and decidability of higher-order process calculi.
Inf. Comput. 209(2),
pp. 198–226,
doi:10.1016/j.ic.2010.10.001.
B. Luttik (2016):
Unique parallel decomposition in branching and weak bisimulation semantics.
Theor. Comput. Sci. 612,
pp. 29–44,
doi:10.1016/j.tcs.2015.10.013.
B. Luttik & V. van Oostrom (2005):
Decomposition orders another generalisation of the fundamental theorem of arithmetic.
Theor. Comput. Sci. 335(2-3),
pp. 147–186,
doi:10.1016/j.tcs.2004.11.019.
R. Milner & F. Moller (1993):
Unique Decomposition of Processes.
Theor. Comput. Sci. 107(2),
pp. 357–363,
doi:10.1016/0304-3975(93)90176-T.
F. Moller (1989):
Axioms for Concurrency.
University of Edinburgh.
F. Moller (1990):
The Importance of the Left Merge Operator in Process Algebras.
In: Automata, Languages and Programming, 17th International Colloquium, ICALP90,
pp. 752–764,
doi:10.1007/BFb0032072.
F. Moller (1990):
The Nonexistence of Finite Axiomatisations for CCS Congruences.
In: Proceedings of LICS '90,
pp. 142–153,
doi:10.1109/LICS.1990.113741.
D. Sangiorgi & D. Walker (2001):
π-Calculus: A Theory of Mobile Processes.
Cambridge University Press,
New York, NY, USA.
eptcs@eptcs.org