Abstract: The invention relates to a method for synchronizing interconnected critical devices comprising servers and clients, each critical device being connected to another critical device by a virtual link, each termination of which is associated with a minimum and a maximum value of transmission time for a data packet, the method, implemented periodically, comprising: the reception of a message at a reception instant, said message comprising at least one time reference determined by a transmitter server, for each message received, the estimation of the current time of the transmitter server on the basis of: the time reference, a value of the internal clock of the current critical device at the current instant and at the reception instant, the minimum value and the maximum value of transmission time of the virtual link between the transmitter server and the current critical device.

Abstract: A testing method including defining a plurality of test periods, and for each current test period collecting flight data from at least two separate avionics systems operating independently, analyzing consistency between the data collected during the previous test period, and/or between the data and flight data collected during an earlier test period, while verifying a plurality of predetermined consistency rules, and when at least one of these rules is not verified, generating an alert relative to a loss of integrity of the avionics.

Abstract: A method for controlling communications within an ad hoc mobile network includes a plurality of terminals having the slave function and/or the master function, said slave terminals also including a slave orchestration system, said master terminals also including a master orchestration system. The slave orchestration system includes at least one network test module, a module for controlling communications, and a database of communications to be set up and an administration module. The master orchestration system includes at least one network test module, a module for controlling communications, a database of communication requirements, a decision engine, a database of current communications, a rule database for prioritizing communications, and an administration module.

Abstract: The present invention includes a method for sharing a quantity of resources between several users in a telecommunication network or a computing system starting from a given date. The method includes updating a tree, each node of which represents a time period. The tree contains at least one node representing a time period including the given date. The concatenation of the time periods represented by daughter nodes of a parent node represent the time period represented by the parent node.

Abstract: The present invention includes a method for sharing a quantity of resources between several users in a telecommunication network or a computing system starting from a given date. The method includes updating a tree, each node of which represents a time period. The tree contains at least one node representing a time period including the given date. The concatenation of the time periods represented by daughter nodes of a parent node represent the time period represented by the parent node.

Abstract: A method for controlling communications within an ad hoc mobile network includes a plurality of terminals having the slave function and/or the master function, said slave terminals also including a slave orchestration system, said master terminals also including a master orchestration system. The slave orchestration system includes at least one network test module, a module for controlling communications, and a database of communications to be set up and an administration module. The master orchestration system includes at least one network test module, a module for controlling communications, a database of communication requirements, a decision engine, a database of current communications, a rule database for prioritizing communications, and an administration module.

Abstract: A method is dedicated to the management of a resource schedule presenting a chosen time granularity and covering a chosen overall period, each resource being capable of being divided into resource fractions each associated with a reservation period defined at least by an initial instant. This method consists, firstly, of storing the schedule in the form of a so-called “n-ary” tree, that is a tree of order n, where n is two or more, equipped with leaves (Nj4), each representing a time interval (Tj) equal to the chosen granularity, and of branches growing from nodes (Nji) each corresponding to a secondary period equal to the sum of the time intervals (Tj) represented by all of the leaves which are associated with it, and secondly, storing in each node (Nji) known as a primary node because it belongs to a set of a minimum number of nodes jointly representing a reservation period, the data representing the maximum reserved resource quantity in the corresponding secondary period.