SYRF Project

Task 5.2.1: "Strong synchrony/true concurrency"

Abstract of deliverable 5.2.1

Back to the SYRF Home Page



Approach:

Our objective is to fundamentally understand how strong synchrony and true concurrency are related, and how one can transform a system of the one class into a system of the other one. This work has several facets:

The first point is addressed in task 4.1 (code distribution), here we concentrate on the second one. We first recognized that this point amounts to constructing a suitable dating function, compatible with the partial ordering of events in the considered program. Thus we concentrated on this problem of dating, and this resulted in a new, comprehensive way, to manipulate dating for synchronous and truly asynchronous programs using a new symbolic algebra generalizing the MaxPlus linear algebra introduced by Cohen and Quadrat in the eighties for timed event graphs.

Achieved Results:

Publications:
  1. A. Benveniste, C. Jard, and S. Gaubert
    MaxPlus techniques for timed systems (DRAFT)
    manuscript, October 1997