Liveness Analysis Of Message-Based Multiprocess Systems

Abstract

AbstractThe problem of compile-time detection of unliveness (i.e., deadlock and dangling messages) in message-based multiprocess systems is discussed. In particular, flow analysis is used to generate event graphs of processes from their program text. These graphs are used to define the transition matrix of the system. It is shown that the system’s initial state and transition matrix provide the necessary information for the liveness analysis algorithm. The effect of channel capacity and system characteristics on the behavior of the algorithm is discussed.