2000 character limit reached
Modular Analysis of Tree-Topology Models (2012.04739v1)
Published 8 Dec 2020 in cs.LO
Abstract: We investigate networks of automata that synchronise over common action labels. A graph synchronisation topology between the automata is defined in such a way that two automata are connected iff they can synchronise over an action. We show a very effective reduction of networks of automata with tree-like synchronisation topologies. The reduction preserves a certain form of reachability, but not safety. The procedure is implemented in an open-source tool.