Cyclic steady state behavior subject to grid-like network constraints

Abstract

The paper’s objective concerns assessing a structure constraints of a grid-like network of periodically acting local cyclic processes interacting via shared resources from the perspective of Cyclic steady States Space (CSS) reachability. Interaction of concurrently flowing local processes follows a mutual exclusion protocol determined by a set of priority dispatching rules determining an order in which competing processes can access to common shared resources. The main problem is in essence to identify conditions deciding about the scale and amount of cyclic steady states reachable in such networks. Such conditions allows one to replace the exhaustive search for the admissible dead-lock-free control of the whole network by focusing on its small size parts. The proposed methodology behind fast assessment of cyclic steady states reachable in grid-like structure of cyclic process is clarified through multiple illustrative examples.