Practical Distributed Control Synthesis

Classic distributed control problems have an interesting dichotomy: they are either trivial or undecidable. If we allow the controllers to fully synchronize, then synthesis is trivial. In this case, controllers can effectively act as a single controller with complete information, resulting in a trivial control problem. But when we eliminate communication and restrict the supervisors to locally available information, the problem becomes undecidable. In this paper we argue in favor of a middle way. Communication is, in most applications, expensive, and should hence be minimized. We therefore study a solution that tries to communicate only scarcely and, while allowing communication in order to make joint decision, favors local decisions over joint decisions that require communication.

💡 Research Summary

The paper addresses a long‑standing dichotomy in distributed control synthesis: when controllers are fully synchronized the synthesis problem collapses to a trivial single‑controller case, but when communication is completely disallowed and each supervisor can only use locally available information, the problem becomes undecidable. The authors argue that in most practical settings communication is costly and should be used sparingly, and they propose a middle‑ground approach that allows limited, “sparse” communication only when it is essential for making joint decisions, while preferring purely local decisions whenever possible.

The technical core of the work is a knowledge‑based control framework built on top of 1‑safe Petri nets. A Petri net models the distributed system as places (states) and transitions (actions). The authors extend this model by attaching to each transition a Boolean predicate over a set of process‑local variables and a transformation function that updates those variables when the transition fires. This yields an “extended Petri net” in which the firing condition of a transition is the conjunction of the classic token‑based enabling condition and the additional variable predicate. The variables serve as a finite memory that can store knowledge acquired through previous interactions, and they are partitioned so that each original process owns a disjoint set of variables.

Control objectives are expressed as generalized invariants I ⊆ S × T, i.e., a set of admissible state‑transition pairs. Enforcing I means that the system may only execute transitions that belong to I. The authors also treat priority constraints by defining a partial order ≪ on transitions and constructing a restricted transition set I≪ that excludes any transition that is pre‑empted by a higher‑priority enabled transition.

To synthesize a controller, the original net N and the invariant I are transformed into a new extended net N′. The transformation obeys strict syntactic constraints: (1) new places and transitions are added disjointly from the original ones; (2) the input and output places of existing transitions are unchanged; (3) additional predicates and variable updates may be attached to existing transitions; (4) no infinite firing sequence can consist solely of newly added transitions. The added transitions and places constitute supervisory processes that implement the sparse communication protocol. When a supervisor needs additional knowledge, it can request it from neighboring processes, thereby temporarily synchronizing a small subset of the system. Because the added components never alter the original token flow, the set of reachable states of N′ projected onto the original places is a subset of the reachable states of N; consequently, the transformation cannot introduce new unsafe behaviours.

Two lemmas underpin the correctness argument. Lemma 1 shows that the reachable state set of the transformed net is contained in that of the original net, and that executions of the transformed net are prefixes of executions of the original net. Lemma 2 establishes that the control transformation yields a finite‑state supervisor, preserving the decidability of the control problem for finite‑state systems.

The authors evaluate their method on several benchmark Petri nets, including pipeline, ring, and memory‑access hierarchies, as well as more general topologies. In each case, the synthesized controller respects the given invariant while requiring far fewer communication events than a fully synchronized solution. The experiments demonstrate that sparse communication can dramatically reduce overhead without sacrificing safety or priority guarantees.

In conclusion, the paper presents a practical synthesis technique that bridges the gap between the trivial fully‑synchronized case and the undecidable fully‑distributed case. By leveraging knowledge‑based reasoning, finite local memories, and carefully constrained supervisory extensions, the approach yields finite‑state controllers that enforce arbitrary safety and priority specifications while minimizing communication. This contribution advances the state of the art in automated distributed control synthesis and provides a solid foundation for future work on scalable, cost‑aware controller generation for complex distributed systems.