On Communicating Finite-State Machines
Journal of the ACM (JACM)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Additional comments on a problem in concurrent programming control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
An exercise in constructing multi-phase communication protocols
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
Proving safety and liveness of communicating processes with examples
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Closed Covers: to Verify Progress for Communicating Finite State Machines
Closed Covers: to Verify Progress for Communicating Finite State Machines
On the Progress of Communication Between Two Machines
On the Progress of Communication Between Two Machines
On Deciding Progress for a Class of Communication Protocols
On Deciding Progress for a Class of Communication Protocols
Proving Liveness for Networks of Communicating Finite State Machines
Proving Liveness for Networks of Communicating Finite State Machines
Proving liveness for networks of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
To correct communicating finite state machines
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
| Hi-index | 0.00 |
Consider a network of communicating finite state machines that exchange messages over unbounded, FIFO channels. Each machine in this network has a finite number of states (called nodes), and state transitions (called edges), and can be defined by a labelled directed graph. A node in one of the machines is said to be “live” iff it is reached by its machine infinitely often during the course of communication, provided that the machines behave in some “fair” fashion. We discuss a technique to verify that a given node is live in such a network. This technique can be automated, and is effective even if the network under consideration is unbounded (i.e. has an infinite number of reachable states). We use our technique to establish the liveness of three distributed solutions to the mutual exclusion problem.