A. Arnold, Finite Transition Systems, 1994.

A. Arnold and M. Nivat, Comportements de processus, Colloque AFCET "Les mathématiques de l'Informatique, pp.35-68, 1982.

G. Boudol, Notes of algebraic calculi of processes, Logics and Models of Concurrent Systems, volume F-13 of NATO ASI series, pp.261-303, 1985.
URL : https://hal.archives-ouvertes.fr/inria-00076161

R. Bryant, Binary decision diagrams and beyond: Enabling technologies for formal verification, Proceedings of the International Conference on Computer Aided Design, ICCAD'95, 1995.

D. , On infinite transition graphs having a decidable monadic secondorder theory, 23th International Colloquium on Automata Languages and Programming, vol.1099, pp.194-205, 1996.

G. Chaitin, A Theory of Program Size Formally Identical to Information Theory, J. Assoc. Compt. Mach, issue.22, pp.329-340, 1975.

B. Courcelle, The monadic second-order logic of graphs, II: Infinite graphs of bounded width, Mathematical System Theory, vol.21, pp.187-221, 1989.

A. Emerson, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pp.997-1072, 1990.

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM, vol.32, pp.137-162, 1985.
DOI : 10.1145/2455.2460

URL : https://www.scss.tcd.ie/Matthew.Hennessy/pubs/old/HMjacm85.pdf

T. Knapik, Domains of word-functions and Thue specifications, 1997.

D. Kozen and J. Tiuryn, Logics of programs, Formal Models and Semantics, pp.789-840, 1990.

R. P. Kurshan, Computer-aided Verification of Coordinating Processes, 1994.

K. Mcmillan, Symbolic Model Checking. Kluwer, 1993.

R. Milner, Calculus of Communicating Systems, LNCS, vol.82, 1980.

D. E. Muller and P. E. Schupp, The theory of ends, pushdown automata and second-order logic, Theoretical Comput. Sci, vol.37, pp.51-75, 1985.

M. Nivat, Sur la synchronisation des processus, Revue technique Thomson-CSF, issue.11, pp.899-919, 1979.