A dioid model for invariant resource sharing problems

Authors:
Aurélien Corréïa;Abdeljalil Abbas-Turki;Rachid Bouyekhf;Abdellah El Moudni
Affiliations:
Hitachi Europe SAS, Velizy, France;Université de Technologie de Belfort-Montbéliard, Belfort Cedex, France;Université de Technologie de Belfort-Montbéliard, Belfort Cedex, France;Université de Technologie de Belfort-Montbéliard, Belfort Cedex, France
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
2009

Citing 2
Cited 1

A log (N) distributed mutual exclusion algorithm based on path reversal

Journal of Parallel and Distributed Computing
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM

Networked conflicting timed event graphs representation in (Max,+) algebra

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a model for invariant resource sharing problems in dioid algebra. A strong motivation for investigating the issue is the absence of a general systematic technique which can be used to tackle these problems. (min, +) constraints have been developed to handle resource sharing in Discrete-Event Dynamic Systems. In particular, the part that can be modeled by a Timed Event Graph induce (min, +)-linear equations which are constrained by the resource availability. The proposed algebraic model has been proved to describe the actual behavior of the systems dealt with. This paper will show two examples of systems that are modeled and controlled by means of this approach.