M. To, our formalism supports nondeterministic specifications (wrt. outputs) Hence, MIA establishes a theoretically clean and practical interface theory that fixes the shortcomings of related work Regarding future work, we plan to study the algorithmic complexity implied by MIA-refinement [12], and MIA's expressiveness in comparison to other theories via thoroughness [6]. On the practical side, we wish to adapt existing tool support for interface theories

]. M. Abadi and L. Lamport, Conjoining specifications, ACM Transactions on Programming Languages and Systems, vol.17, issue.3, pp.507-534, 1995.
DOI : 10.1145/203095.201069
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.4928

S. Bauer, R. Hennicker, and M. Wirsing, Interface theories for concurrency and data, Theoretical Computer Science, vol.412, issue.28, pp.3101-3121, 2011.
DOI : 10.1016/j.tcs.2011.04.007
URL : http://doi.org/10.1016/j.tcs.2011.04.007

S. Bauer, P. Mayer, A. Schroeder, and R. Hennicker, On Weak Modal Compatibility, Refinement, and the MIO Workbench, TACAS, pp.175-189, 2010.
DOI : 10.1007/978-3-642-12002-2_15

L. De-alfaro and T. A. Henzinger, Interface automata, FSE, pp.109-120, 2001.

L. De-alfaro and T. A. Henzinger, Interface-Based Design, Engineering Theories of Software-Intensive Systems, 2005.
DOI : 10.1007/1-4020-3532-2_3

H. Fecher, D. De-frutos-escrig, G. Lüttgen, and H. Schmidt, On the Expressiveness of Refinement Settings, FSEN, pp.276-291, 2009.
DOI : 10.1007/978-3-642-11623-0_16

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

K. G. Larsen, U. Nyman, and A. Wasowski, Modal I/O Automata for Interface and Product Line Theories, ESOP, pp.64-79, 2007.
DOI : 10.1007/978-3-540-71316-6_6
URL : http://vbn.aau.dk/files/16109957/ESOP2007withappendix.pdf

K. G. Larsen, B. Steffen, and C. Weise, A constraint oriented proof methodology based on modal transition systems, TACAS, pp.17-40, 1995.
DOI : 10.7146/brics.v1i47.21595
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.4946

K. G. Larsen and L. Xinxin, Compositionality Through an Operational Semantics of Contexts, Journal of Logic and Computation, vol.1, issue.6, pp.761-795, 1991.
DOI : 10.1093/logcom/1.6.761

G. Lüttgen and W. Vogler, Ready simulation for concurrency: It?s logical!, Information and Computation, vol.208, issue.7, pp.845-867, 2010.
DOI : 10.1016/j.ic.2010.02.001

J. Raclet, E. Badouel, A. Benveniste, B. Caillaud, A. Legay et al., A modal interface theory for component-based design, Fund. Inform, vol.107, pp.1-32, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00554283

M. Schäfer and W. Vogler, Component refinement and CSC-solving for STG decomposition, Theoretical Computer Science, vol.388, issue.1-3, pp.243-266, 2007.
DOI : 10.1016/j.tcs.2007.08.005