F. Aarts and F. W. Vaandrager, Learning I/O Automata, Proc. of CONCUR 2010, pp.71-85, 2010.
DOI : 10.1007/978-3-642-15375-4_6

L. Aceto, I. Fábregas, D. De-frutos-escrig, A. Ingólfsdóttir, and M. Palomino, Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations, Proc. of FSEN 2011, pp.268-283, 2012.
DOI : 10.1007/978-3-642-29320-7_18

L. Aceto, W. J. Fokkink, and C. Verhoef, Structural operational semantics. Handbook of Process Algebra, pp.197-292, 2001.

R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi, Alternating refinement relations, Proc. of CONCUR'98, pp.163-178, 1998.
DOI : 10.1007/BFb0055622
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1421

J. C. Baeten, T. Basten, and M. A. Reniers, Process Algebra: Equational Theories of Communicating Processes, 2009.
DOI : 10.1017/CBO9781139195003

J. C. Baeten, D. A. Van-beek, B. Luttik, J. Markovski, and J. E. Rooda, A processtheoretic approach to supervisory control theory, American Control Conference (ACC), pp.4496-4501, 2011.

J. C. Baeten and C. Verhoef, A congruence theorem for structured operational semantics with predicates, International Conference on Concurrency Theory (CONCUR'93), pp.477-492, 1993.
DOI : 10.1007/3-540-57208-2_33

M. Van-der-bijl, A. Rensink, and J. Tretmans, Compositional Testing with ioco, Formal Approaches to Software Testing, pp.86-100, 2004.
DOI : 10.1007/978-3-540-24617-6_7

B. Bloom, W. Fokkink, and R. J. Van-glabbeek, Precongruence formats for decorated trace semantics, ACM Transactions on Computational Logic, vol.5, issue.1, pp.26-78, 2004.
DOI : 10.1145/963927.963929
URL : http://arxiv.org/abs/cs/0204039

R. Bol and J. F. Groote, The meaning of negative premises in transition system specifications, Journal of the ACM, vol.43, issue.5, pp.863-914, 1996.
DOI : 10.1145/234752.234756

G. Boudol and K. G. Larsen, Graphical versus logical specifications, Theoretical Computer Science, vol.106, issue.1, pp.3-20, 1992.
DOI : 10.1016/0304-3975(92)90276-L
URL : https://hal.archives-ouvertes.fr/inria-00075455

L. De-alfaro and T. A. Henzinger, Interface automata, Proc. of ESEC/FSE-9, pp.109-120, 2001.

W. J. Fokkink, R. J. Van-glabbeek, and P. De-wind, Compositionality of Hennessy???Milner logic by structural operational semantics, Theoretical Computer Science, vol.354, issue.3, pp.421-440, 2006.
DOI : 10.1016/j.tcs.2005.11.035

J. F. Groote, Transition system specifications with negative premises, Theoretical Computer Science, vol.118, issue.2, pp.263-299, 1993.
DOI : 10.1016/0304-3975(93)90111-6
URL : http://doi.org/10.1016/0304-3975(93)90111-6

K. G. Larsen, Modal specifications Automatic Verification Methods for Finite State Systems, LNCS, vol.407, pp.232-246, 1990.

K. G. Larsen and B. Thomsen, A modal process logic, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, pp.203-210, 1988.
DOI : 10.1109/LICS.1988.5119

G. Lüttgen and W. Vogler, Modal interface automata, Proc. of TCS'12, pp.265-279, 2012.

R. Milner, An algebraic definition of simulation between programs, Proceedings of the 2nd International Joint Conference on Artificial Intelligence, IJCAI, pp.481-489, 1971.

M. R. Mousavi, M. A. Reniers, and J. F. Groote, SOS formats and meta-theory: 20 years after, Theoretical Computer Science, vol.373, issue.3, pp.238-272, 2007.
DOI : 10.1016/j.tcs.2006.12.019
URL : http://doi.org/10.1016/j.tcs.2006.12.019

D. Park, Concurrency and automata on infinite sequences, Proceedings of the 5th GI-Conference on TCS, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

G. D. Plotkin, A structural approach to operational semantics, JLAP, vol.60, pp.17-139, 2004.

J. Tretmans, Model Based Testing with Labelled Transition Systems, Formal Methods and Testing, pp.1-38, 2008.
DOI : 10.1007/978-3-540-78917-8_1

R. J. Van-glabbeek, The meaning of negative premises in transition system specifications II, The Journal of Logic and Algebraic Programming, vol.60, issue.61, pp.60-61229, 2004.
DOI : 10.1016/j.jlap.2004.03.007