J. Aranda, F. Valencia, and C. Versari, On the Expressive Power of Restriction and Priorities in CCS with Replication, FOSSACS, p.242256, 2009.
DOI : 10.1007/978-3-540-85361-9_37

URL : https://hal.archives-ouvertes.fr/inria-00430531

S. Bliudze and J. Sifakis, The Algebra of Connectors—Structuring Interaction in BIP, IEEE Transactions on Computers, vol.57, issue.10, p.13151330, 2008.
DOI : 10.1109/TC.2008.26

S. Bliudze and J. Sifakis, A Notion of Glue Expressiveness for Component-Based Systems, In CONCUR LNCS, vol.5201, p.508522, 2008.
DOI : 10.1007/978-3-540-85361-9_39

R. Cleaveland, G. Lüttgen, and V. Natarajan, Priority in Process Algebra, 1999.
DOI : 10.1016/B978-044482830-9/50030-8

C. , D. Giusto, M. Gabbrielli, and M. C. Meo, On the expressive power of multiple heads in chr, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00909390

J. Esparza and M. Nielsen, Decidability issues for petri nets -a survey, Bulletin of the EATCS, vol.52, p.244262, 1994.
DOI : 10.7146/brics.v1i8.21662

URL : http://ojs.statsbiblioteket.dk/index.php/brics/article/download/21662/19099

C. A. Hoare, Communicating Sequential Processes, International Series in Computer Science, 1985.
DOI : 10.1145/357980.358021

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.6772

C. Laneve and A. Vitale, The Expressive Power of Synchronizations, 2010 25th Annual IEEE Symposium on Logic in Computer Science, p.382391, 2010.
DOI : 10.1109/LICS.2010.15

F. Maraninchi and Y. Rémond, Mode-Automata: a new domain-specific construct for the development of safe critical systems, Science of Computer Programming, vol.46, issue.3, 2003.
DOI : 10.1016/S0167-6423(02)00093-X

M. Minsky, Computation: Finite and Innite Machines, 1967.

I. Phillips, CCS with priority guards, J. Log. Algebr. Progr, vol.75, issue.1, p.139165, 2008.
DOI : 10.1007/3-540-44685-0_21

C. Versari, N. Busi, and R. Gorrieri, An expressiveness study of priority in process calculi, Mathematical Structures in Computer Science, vol.4703, issue.06, p.11611189, 2009.
DOI : 10.1007/978-3-540-74407-8_17