slideShow – FUCHSIA

Fuchsia Seminar

A Fuchsia Seminar is scheduled on the 2nd of December in Yaoundé, alongside of LIRIMA Scientific Days and the CRI conference, with a participation of Eric Badouel, Adrian Puerto Aubel and Benoît Masson. Agenda 9H-9H15 Opening words, Prof. Bouetou, Head of Department GI / ENSP. 9H15 – 10H Instant chat tools, Benoit Masson, AGORA. 10H-10H30 Coffee break 10H30-11H15 Argumentation and GAG, Adrian Puerto Aubel, INRIA Rennes. 11h15-12H Asynchronous Actors coordination via the Publish-Subscribe Model, Joskell Ngoufo, PhD student UDs. 12H-12H30 Analyzing accessibility variability in operating systems with relational concept analysis and pattern structures, Wafo Kahou, PhD student, ENSP 12H30-14H Lunch 14H-14H45 Bi-intuitionist logic and dialogue games, Eric Badouel, INRIA Rennes. 14h45-15H30 Tools for modeling GAGs, Willy Kengne Kungne, PhD student UDs. 15H30-16H Coffee break 16H-17H Slack demonstration, Benoit Masson, AGORA 17H Closing, Review of the day

Kick-off Meeting

The team organized a kick-off meeting in Yaoundé from April 23 to 24, 2019 (with a participation of Eric Badouel who came at the occasion of Nsaibirni’s PhD defense). Date and Localization On the 22-23rd of April 2019, at ENSP, University Of Yaoundé I, Cameroon. Program Day Timing Author/Chair Talk Monday 22/4/2019 9h -10h30 Eric Badouel Presentation of the FUCHSIA Project and ANR Astrid 10h30 – 11h Coffee break 11h – 11h45 Nsaibirni Junior 14h – 15h Djeumen Rodrigue Interface, Role and Micro Services in Distributed Collaborative Systems 15h – 16h Georges Kouamou Step evaluation Tuesday 23/4/2019 9h -10h30 Willy Kungne A model and a service composition platform based on GAGs 10h30 – 11h Joskel Ngoufo 11h – 11h45 Eric Badouel Organization of first year activities 14h – 15h Eric Badouel Perspectives: – Visit of trainees in Rennes – Reflections on internship proposals Summary of the seminar Participants Eric Badouel,…

Guarded Attribute grammar

Guarded Attribute Grammars (GAG) is a model of cooperative work based on task resolution. A task is solved by dividing it into smaller tasks, solving these sub tasks and combining their results to produce the required output. The decomposition of tasks into smaller tasks is modeled as rewriting rules using the productions of an attribute grammar. The inherited and synthesized attributes of the grammar respectively model the input and output parameters of tasks, while the semantics rules are used to enforce data-flow between a task and its sub tasks, and between sibling tasks. Each task is executed as a co-routine that produces eagerly its output while consuming lazily its input: a piece of information is accessed from its input only when needed and a piece of information is produced in its output as soon as it can be computed. Constraints on the input parameters of tasks are used to restrict…