Laetitia Laversa (Université Sorbonne Paris Nord, LIPN)

Date: Monday, February 19th 2024 – 13h00
Place: B013 (Bob)
Title: Communicating automata and k-synchronizability Distributed systems are ubiquitous and their implementation is complex and error-prone. In order to check for errors, they can be modeled as systems of communicating automata, where each automaton represents the behavior of an element of the system. In general, verification problems are undecidable in such a model. The use of (under or over) approximations is necessary. This talk presents k-synchronizable systems, which are a subclass of systems of communicating automata, and some results on them.

Comments are closed.