Analyse des régimes transitoire et asymptotique d’un graphe d’événements temporisé. (Transient and asymptotic behaviour analysis of a timed event graph). (French) Zbl 0556.68020

After a brief discussion of the concept of timed marked graphs, this article describes their controlled execution in practice. The author’s analysis is based on a developed evaluated graph and sets of potentials generalizing the traditional notion of scheduling problems. The new concepts developed in this way allow us to resolve the problem of a transitional operating mode, i.e. to calculate earliest transition dates for controlled execution. The determination of quantitative characteristics of an asymptotic mode required an optimization problem to be solved first, involving searching for values of maximal paths in a two-valued graph. This article concludes by showing that the developed graph makes it possible to reduce the study of asymptotic modes as a whole to the results obtained for two-valued graphs.


68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N25 Theory of operating systems