Section: New Results
Parameterized Communicating Automata
As a part of our research program on concurrent systems with variable communication topology, we studied system models where the topology is static but unknown, so that it becomes a parameter of the system. In [28] , we introduced parameterized communicating automata (PCAs), where finite-state processes exchange messages via rendez-vous or through bounded FIFO channels. Unlike classical communicating automata, a given PCA can be run on any network topology of bounded degree. We presented various Büchi-Elgot-Trakhtenbrot theorems for PCAs, which roughly read as follows: Let