This thesis proposes the use of a synchronous data flow graph (SDFG) to model the computation of a non-iterative co-simulation. An SDFG is a determinate model of computation with a lot of scheduling research available. A method for creating an SDFG from a co-simulation network, initial tokens and simulator step sizes is described. A simulator in the proposed method is a synchronous data flow actor that is used to model the execution of a co-simulation slave. It is shown that such an SDFG has consistent rates and uniformly updates the states of all simulators. To analyze the behavior of numerical errors introduced in the co-simulation, it is assumed that coupled ordinary differential equations can represent the modeled system. This thesis uses the numerical defect analysis to formulate a co-simulation quality criterion. The numerical defect is divided into integration, output and connection defects. Such a defect distribution reflects the division of responsibility between the co-simulation master and the internal solvers of the slaves. This work proposes how connection defects can be calculated and output defects can be estimated. Integration defects are not analyzed as it is assumed that they are controlled by internal solvers of the slaves. The proposed quality criterion for the co-simulation is based on the aggregation of the output and connection defects. The simulator step sizes, the number and values of the initial tokens should be determined in order to configure the execution of a co-simulation network. A method for calculating the number of initial tokens based on the simulator step sizes is proposed. It is shown that an SDFG with such number of initial tokens does not deadlock. Furthermore, a method how to check whether it can run in real-time is shown. The quality criterion enables an optimization approach to find the values of the initial tokens. In the proposed approach, the quality criterion is assessed in a single iteration of the SDFG. The Nelder-Mead algorithm is used to solve the optimization problem of finding initial token values. To complete the automatic configuration of the co-simulation, the simulator step sizes must be determined. This is done by reducing the simulator step sizes until the requested tolerance is met. This thesis proves that connection and output defects can be controlled by reducing simulator step sizes. The automated configuration algorithm presented in the last chapter is the main goal of this thesis. The methods for determining the step sizes of the simulator, the number and the values of the initial tokens are building blocks of this algorithm. The validity and usefulness of the proposed algorithm is justified with theorems and examples presented throughout this thesis.