Speaker: Arnaud Sangnier
Title: Parameterized Reachability in Networks with Many Identical Processes
Abstract:
In this talk, we will study the decidability and complexity of reachability problems in networks where the number of entities is a priori unknown but where each process follows the same behavior. We will describe algorithmic methods to analyze such networks considering different means of communication between the processes such as rendez-vous communication (with or without a central controller), broadcast communication or reconfigurable broadcast communication (where the broadcast messages are not received by all the processes of the networks).