Parallel simulation of communicating finite state machines

Abstract

We describe, in this paper, a synchronization/deadlock resolution mechanism for a network of communicating finite state machines implemented on a parallel machine. As it is message-based, it is appropriate for distributed memory machines. The technique was inspired by a project at the Jet Propulsion laboratories whose goal is the specification and verification of the software used to control the interplanetary spacecraft operated by the laboratory. The network of communicating finite state machines makes use of write messages to alter the value of the variables describing the finite state machines and read messages to determine the state of the variables. Since a blocking protocol is employed, it is possible for deadlocks to occur. Consequently, we describe deadlock resolution algorithms. Our algorithms were implemented on an iPSC/2 hypercube, demonstrating good performance on a queueing network model.