Identifying Useless States in Non-FIFO Distributed Computations by Using Pseudo Timestamps

In a distributed system, a monitor process collects the execution states and invokes a detection procedure to test and debug the program. This paper investigates the global state analyzing problems for the non-FIFO distributed environments. In this paper, the states unknown to the monitor process are represented by using the pseudo states. Based on this technique, this paper develops an algorithm capable of identifying the maximum number of useless states for the programs run in an non-FIFO distributed environment.