L. Barbosa, Towards a calculus of state-based software components, Journal of Universal Computer Science, vol.9, issue.8, pp.891-909, 2003.

M. Barr and C. Wells, Category theory for computing science, 1995.

G. Bernot, Testing against formal specifications: A theoretical view, TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD), pp.99-119, 1991.
DOI : 10.1007/3540539816_63

E. Brinksma, A theory for the derivation of tests, Protocol Specification, Testing, and Verification (PSTV VIII), pp.63-74, 1988.

S. Brookes and A. W. Roscoe, An improved failures model for communicating processes, pp.281-305, 1984.
DOI : 10.1007/3-540-15670-4_14

T. Jéron and C. Jard, Tgv : theory, principles and algorithms, International Journal on Softaware Tools for Technology Transfer, vol.7, issue.4, pp.297-315, 2000.

S. Eilenberg, Automata, Languages and Machines, volume C, 1978.

J. L. Fiadeiro, Categories for Software Engineering, 2004.

L. Frantzen, J. Tretmans, and T. A. Willemse, A Symbolic Framework for Model-Based Testing, Formal Approaches to Software Testing and Runtime Verification ? FATES/RV 2006, number 4262 in Lecture Notes in Computer Science, pp.40-54, 2006.
DOI : 10.1007/11940197_3

C. Gaston, P. L. Gall, N. Rapin, and A. Touil, Symbolic Execution Techniques for Test Purpose Definition, TestCom, pp.1-18, 2006.
DOI : 10.1007/11754008_1

URL : https://hal.archives-ouvertes.fr/hal-00342082

J. Rutten, H. Hvid-hansen, and D. Costa, Synthesis of mealy machines using derivativesesis of mealy machines, Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science Coalgebraic Methods in Computer Science, vol.164, pp.27-45, 2006.

C. A. Hoare, Communicating sequential processes. cacm, pp.666-677, 1978.

B. Jeannet, T. Jéron, V. Rusu, and E. Zinovieva, Symbolic Test Selection Based on Approximate Analysis, TACAS, pp.349-364, 2005.
DOI : 10.1007/978-3-540-31980-1_23

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

R. Langerak, A testing theory for lotos using deadlock detection, Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX, pp.87-98, 1990.

D. Lee and M. Yannakakis, Principles and methods of testing finite state machines-a survey, Proceedings of the IEEE, 1996.
DOI : 10.1109/5.533956

S. and M. Lane, Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics, 1971.

G. H. Mealy, A method for synthesizing sequentiel circuits, Bell Systems Techn. Jour, 1955.

S. Meng and L. S. Barbosa, Components as coalgebras: The refinement dimension, Theoretical Computer Science, vol.351, issue.2, pp.276-294, 2006.
DOI : 10.1016/j.tcs.2005.09.072

R. Milner, A calculus of communicating systems, 1982.
DOI : 10.1007/3-540-10235-3

R. Milner, Communication and concurrency, 1989.

E. Moggi, Notions of computation and monads. Information and Computation, pp.55-92, 1991.

R. , D. Nicola, and M. C. Hennessy, Testing equivalences for processes. tcs, pp.83-133, 1984.

I. Phillips, Refusal testing, Theoretical Computer Science, vol.50, issue.3, pp.241-284, 1987.
DOI : 10.1016/0304-3975(87)90117-4

J. Rutten, Universal coalgebra: a theory of systems, Theoretical Computer Science, vol.249, issue.1, pp.3-80, 2000.
DOI : 10.1016/S0304-3975(00)00056-6

J. Rutten, Algebraic specification and coalgebraic synthesis of mealy machines, Centrum voor Wiskunde en Informatica (CWI), 2005.

E. D. Sontag, Mathematical control theory: deterministic finite dimensional systems, 1998.

J. Tretmans, A formal approach to conformance testing, Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI, pp.257-276, 1994.

J. Tretmans, Conformance testing with labelled transition systems: Implementation relations and test generation, Computer Networks and ISDN Systems, vol.29, issue.1, pp.49-79, 1996.
DOI : 10.1016/S0169-7552(96)00017-7

J. Tretmans, Test generation with inputs, outputs and repetitive quiescence. Software -Concepts and Tools, pp.103-120, 1996.
DOI : 10.1007/3-540-61042-1_42

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