#### Filter Results:

#### Publication Year

2004

2014

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that if the process p executes k steps without hearing from process q—directly or indirectly—then it will never hear from q again. The non-interleaved branching time behavior of a system of… (More)

We show the regularity of the discrete time behaviour of hybrid automata in which the rates of continuous variables are governed by linear differential operators in a diagonal form and in which the values of the continuous variables can be observed only with finite precision. We do not demand resetting of the values of the continuous variables during mode… (More)

Scenario languages based on Message Sequence Charts (MSCs) and related notations have been widely studied in the last decade [14, 13, 2, 9, 5, 12, 8]. The high expressive power of scenarios renders many basic problems concerning these languages undecidable. The most expressive class for which several problems are known to be decidable is one which possesses… (More)

Verifying systems involving both time and concurrency rapidly leads to undecidability, and requires restrictions to become effective. This paper addresses the emptiness problem for time-constrained MSC-Graphs (TC-MSC graphs for short), that is, checking whether there is a timed execution compatible with a TC-MSC graph specification. This problem is known to… (More)

Rapport de recherche n° 7823 — November 2011 — 15 pages Résumé : Il est notoirement difficile d'analyser les comportements de systémes décrits par des modèles qui comportentà la fois du temps et de la concurrence. Des résultats de décidabilité existent pour des modèles dans lesquels les valeurs des horloges sur différents processus ne peuvent pasêtre… (More)

Good scheduling policies for distributed embedded applications are required for meeting hard real time constraints and for optimizing the use of computational resources. We study the quasi-static scheduling problem in which (uncontrollable) control flow branchings can influence scheduling decisions at run time. Our abstracted distributed task model consists… (More)

We consider a network of hybrid automata that observe and control a plant whose state space is determined by a finite set of continuous variables. We assume that at any instant, these variables are evolving at (possibly different) constant rates. Each automaton in the network controls-i.e. can switch the rates of-a designated subset of the continuous… (More)

The current dominance of the service-based paradigm reflects the success of specific design and architectural principles embodied in terms like SOA and REST. This paper suggests further principles for the design of services exhibiting long-running transactions (that is, transactions whose characteristic feature is that in the case of failure not all system… (More)