J. Abrial, The B-book -assigning programs to meanings.C a m bridge University Press, 2005.

P. Aczel and N. Mendler, A final coalgebra theorem, Proceedings category in computer science, pp.357-365, 1989.
DOI : 10.1007/BFb0018361

M. Aiguier, F. Boulanger, and B. Kanso, A formal abstract framework for modelling and testing complex software systems, Theoretical Computer Science, vol.455, pp.66-97, 2011.
DOI : 10.1016/j.tcs.2011.12.072

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

M. Aiguier, B. Golden, and D. Krob, An Adequate Logic for Heterogeneous Systems, 2013 18th International Conference on Engineering of Complex Computer Systems
DOI : 10.1109/ICECCS.2013.19

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

E. Alaksen and R. Belcher, Systems Engineering, 1992.

R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P. H. Ho et al., The algorithmic analysis of hybrid systems, Theoretical Computer Science, vol.138, issue.1, pp.3-34, 1995.
DOI : 10.1016/0304-3975(94)00202-T

A. Arnold, G. Point, A. Griffault, and A. Rauzy, The altarica formalism for describing concurrent systems, Fundam. Inf.,4, vol.0, issue.2 - 3, pp.109-124, 1999.

J. Bacon and J. Van-der-linden, Concurrent Systems: An Integrated Approach to Operating Systems, Distributed Systems and Database, 2002.

N. Bansal and M. Sviridenko, The Santa Claus problem, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06
DOI : 10.1145/1132516.1132522

G. Berry, The foundations of Esterel.M I TP r e s s

B. Blanchard and W. Fabrycky, Systems engineering and analysis, 1998.

S. Bliudze and D. Krob, Modelling of complex systems: Systems as dataflow machines, Fundamenta Informaticae, vol.91, pp.1-24, 2009.

I. I. Standards-board, IEEE Standard VHDL Language Reference Manual (IEEE Std. 1076-1993)

O. Bournez and M. Campagnolo, New Computational Paradigms Changing Conceptions of What is Computable, rAS u r v e yo nC o n tinuous Time Computations, pp.383-423, 2008.

S. Bouveret and J. Lang, Efficiency and envy-freeness in fair division of indivisible goods, Proceedings of IJCAI

J. Bradfield and C. Stirling, Modal mu-calculi, Handbook of Modal Logic, pp.721-756, 2007.

M. Broy, Refinement of time, Theoretical Computer Science, vol.253, issue.1, pp.3-26, 2001.
DOI : 10.1016/S0304-3975(00)00087-6

M. Broy and G. Stef?, The algebra of stream processing functions, Theoretical Computer Science, vol.258, issue.1-2, pp.99-129, 2001.
DOI : 10.1016/S0304-3975(99)00322-9

M. Broy and K. Stølen, Specification and development of interactive systems: focus on streams, interfaces, and refinement, 2001.
DOI : 10.1007/978-1-4613-0091-5

P. Caspi and M. Pouzet, Synchronous Kahn networks, ACM SIGPLAN Notices, vol.31, issue.6, pp.226-238, 1996.
DOI : 10.1145/232629.232651

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

D. Cha, J. Rosenberg, and C. Dym, Fundamentals of Modeling and Analysing Engineering Systems, 2000.

Y. Chevaleyre, U. Endriss, J. Lang, and N. Maudet, Negotiating over small bundles of resources, Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems , AAMAS '05
DOI : 10.1145/1082473.1082518

K. M. Chong, An induction theorem for rearrangements, Journal canadien de math??matiques, vol.28, issue.1, pp.154-160, 1976.
DOI : 10.4153/CJM-1976-019-4

A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, Math. Surveys Amer. Math. Soc., R.I, vol.7, 1961.

P. Cousot and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation offi x points, Conference Record of the Fourth Annual ACM Symposium on Principles of Programming Languages, 1977.

J. B. Dennis, First version of a data flow procedure language, Programming Symposium Proceedings Colloque sur la Programmation, pp.362-376, 1974.
DOI : 10.1007/3-540-06859-7_145

F. Diener and G. Reeb, Analyse Non Standard

T. Gajdos, Single crossing Lorenz curves and inequality comparisons, Mathematical Social Sciences, vol.47, issue.1, pp.21-36, 2004.
DOI : 10.1016/S0165-4896(03)00078-7

URL : https://hal.archives-ouvertes.fr/halshs-00086028

I. P. Gent, R. W. Irving, D. F. Manlove, P. Prosser, and B. M. Smith, A Constraint Programming Approach to the Stable Marriage Problem, CP01, pp.225-239, 2001.
DOI : 10.1007/3-540-45578-7_16

B. Golden, M. Aiguier, and D. Krob, Modeling of complex systems II: A minimalist and unified semantics for heterogeneous integrated systems, Applied Mathematics and Computation, vol.218, issue.16, pp.8039-8055, 2012.
DOI : 10.1016/j.amc.2012.01.048

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

B. Golden and Y. Hourdel, A minimalist formal framework for systems architecting, 3rd International Workshop on Model Based Safety Assessment

B. Golden and P. Perny, Infinite order lorenz dominance for fair multiagent optimization, AAMAS
URL : https://hal.archives-ouvertes.fr/hal-01291403

J. Goldsmith and R. Sloan, The conference paper assignment problem, Proc. AAAI Workshop on Preference Handling for Artificial Intelligence, 2007.

M. Guo and V. Conitzer, Undominated VCG redistribution mechanisms, Proceedings of AAMAS'08

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, The synchronous data flow programming language LUSTRE, Proceedings of the IEEE, 1991.
DOI : 10.1109/5.97300

T. A. Henzinger, The theory of hybrid automata, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, p.278, 1996.
DOI : 10.1109/LICS.1996.561342

G. Kahn, The semantics of a simple language for parallel programming, Information processing, pp.471-475, 1974.

P. Kosiuczenko and M. Wirsing, Timed rewriting logic with an application to object-based specification, Science of Computer Programming, vol.28, issue.2-3, pp.2-3225, 1997.
DOI : 10.1016/S0167-6423(96)00024-X

D. Krob, Modelling of complex software systems: a reasoned overview1 international conferenceo nF o r m a l Techniques for Networked and Distributed Systems, Proceedings of the 26th IFIP WG 6, pp.1-22, 2006.

H. Levy, Stochastic Dominance and Expected Utility: Survey and Analysis, 41] J. Lygeros. Lecture notes on hybrid systems Notes for an ENSIETA Workshop, pp.555-593, 1992.
DOI : 10.1287/mnsc.38.4.555

M. Maier and E. Rechtin, The art of system architecturing.C R CP r e s s, 2002.

L. Mandel and M. Pouzet, ReactiveML, a Reactive Extension to ML, ACM International Conference on Principles and Practice of Declarative Programming (PPDP), 2005.
URL : https://hal.archives-ouvertes.fr/hal-01489747

W. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications, 1979.
DOI : 10.1007/978-0-387-68276-1

G. H. Mealy, A method for synthesizing sequential circuits, The Bell System Technical Journal, vol.34, issue.5
DOI : 10.1002/j.1538-7305.1955.tb03788.x

H. Moulin, Axioms of cooperative decision making, 1988.
DOI : 10.1017/CCOL0521360552

E. Nelson, Internal set theory: A new approach to nonstandard analysis, Bulletin of the American Mathematical Society, vol.83, issue.6, pp.1165-1198, 1977.
DOI : 10.1090/S0002-9904-1977-14398-X

W. Ogryczak, Inequality measures and equitable approaches to location problems, European Journal of Operational Research, vol.122, issue.2, pp.374-391, 2000.
DOI : 10.1016/S0377-2217(99)00240-4

W. Ogryczak and T. Sliwinski, On solving linear programs with the ordered weighted averaging objective, European Journal of Operational Research, vol.148, issue.1, pp.80-91, 2003.
DOI : 10.1016/S0377-2217(02)00399-5

P. Perny and O. Spanjaard, An axiomatic approach to robustness in search problems with multiple scenarios, Proceedings of the 19th conference on Uncertainty in Artificial Intelligence

A. Rabinovitch, Automata over continuous time, Theoretical Computer Science, vol.300, issue.1-3, pp.331-363, 2003.
DOI : 10.1016/S0304-3975(02)00331-6

F. Robert, Les systèmes dynamiques discrets, Mathématiques et Applications, vol.1, issue.91

A. Robinson, Non-standard analysis, 1974.

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 Automata, International Workshop on Formal Aspects of Component Software (FACS 2005), pp.305-319, 2006.
DOI : 10.1016/j.entcs.2006.05.030

A. Sage and J. Amstrong, Introduction to system engineering, 2000.

A. Sen, On economic inequality, 1997.
DOI : 10.1093/0198281935.001.0001

A. F. Shorrocks, Ranking Income Distributions, Economica, vol.50, issue.197, pp.3-17, 1983.
DOI : 10.2307/2554117

URL : http://doi.org/10.2307/2554117

E. Sontag, Mathematical Control Theory: Deterministic Finite Dimensional Systems, of Textbooks in Applied Mathematics, 1998.

B. A. Trakhtenbrot, Understanding basic automata theory in the continuous time setting, Fundam. Inform

W. Turner, J. Mize, K. Case, and J. Nazemeth, Introduction to industrial and systems engineering, 1993.

J. Von-neumann and O. Morgenstern, Theory of games and economic behavior, 1947.

M. E. Yaari, The Dual Theory of Choice under Risk, Econometrica, vol.55, issue.1, pp.95-115, 1987.
DOI : 10.2307/1911158

R. R. Yager, On ordered weighted averaging aggregation operators in multicriteria decisionmaking, IEEE Transactions on Systems, Man, and Cybernetics, vol.18, issue.1, pp.183-190, 1998.
DOI : 10.1109/21.87068

J. Zaytoun, Systèmes dynamiques hybrides.H e r m e s

B. P. Zeigler, H. Praehofer, and K. T. Gon, Theory of Modeling and Simulation ? Integrating Discrete Event and Continuous ComplexD y n a m i c Systems, 2000.

C. Zhou and R. Kumar, Semantic translation of simulink diagrams to input/output extended finite automata. Discrete Event Dynamic Systems, pp.223-247, 2012.