2010/07/28 by Imene Ben-Hafaiedh, Susanne Graf, Hammadi Khairallah
Computer Science · #Distributed systems and fault tolerance #Formal Methods in Verification #Real-Time Systems Scheduling #cs.DC #cs.PL #cs.SE
paper · pdf · doi:10.4204/eptcs.30.3
published as EPTCS 30, 2010, pp. 31-46 · In Proceedings FOCLASA 2010, arXiv:1007.4993
openalex publication_date 2010/07/28 · arxiv created 2010/07/29 · arxiv updated 2010/07/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31
Implementing a component-based system in a distributed way so that it ensures some global constraints is a challenging problem. We consider here abstract specifications consisting of a composition of components and a controller given in the form of a set of interactions and a priority order amongst them. In the context of distributed systems, such a controller must be executed in a distributed fashion while still respecting the global constraints imposed by interactions and priorities. We present in this paper an implementation of an algorithm that allows a distributed execution of systems with (binary) interactions and priorities. We also present a comprehensive simulation analysis that shows how sensitive to changes our algorithm is, in particular changes related to the degree of conflict in the system.