On Communicating Finite-State Machines

@article{Brand1983OnCF,
  title={On Communicating Finite-State Machines},
  author={D. Brand and P. Zafiropulo},
  journal={J. ACM},
  year={1983},
  volume={30},
  pages={323-342}
}
  • D. Brand, P. Zafiropulo
  • Published 1983
  • Computer Science
  • J. ACM
  • A model of commumcations protocols based on finite-state machines is investigated. The problem addressed is how to ensure certain generally desirable properties, which make protocols "wellformed," that is, specify a response to those and only those events that can actually occur. It is determined to what extent the problem is solvable, and one approach to solving it ts described. Categories and SubJect Descriptors' C 2 2 [Computer-Conununication Networks]: Network Protocols-protocol… CONTINUE READING
    1,089 Citations

    Figures and Topics from this paper

    Model Checking Communication Protocols
    • 5
    • Highly Influenced
    Verifying Programs with Unreliable Channels
    • 241
    • PDF
    Analysis of a class of communicating finite state machines
    • 17
    Decidability of the termination problem for completely specified protocols
    • A. Finkel
    • Computer Science
    • Distributed Computing
    • 2005
    • 67
    A Relational Algebraic Approach to Protocol Verification
    • 23
    Probabilistic Lossy Channel Systems
    • 56
    • PDF
    Data flow analysis of communicating finite state machines
    • 70
    • PDF
    To correct communicating finite state machines