Proving liveness for networks of communicating finite state machines

DOI10.1145/5001.5002zbMath0593.68016OpenAlexW2011723719MaRDI QIDQ3723681

Chung-Kuo Chang, Mohamed G. Gouda

Publication date: 1986

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1986-8/

zbMATH Keywords

communication protocolsalternating bit protocolfair progressunbounded FIFO channelsCSMA/CD protocoledge fairnessnetwork fairnessnetwork of communicating finite state machinesnode fairnessnode livenessstart-stop protocol

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (7)

Complexity of reachability problems for finite discrete dynamical systems ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ Agent-Based Modeling, Mathematical Formalism for ⋮ Communicating processes, scheduling, and the complexity of nontermination ⋮ ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS ⋮ Global and local views of state fairness

This page was built for publication: Proving liveness for networks of communicating finite state machines