On Communicating Finite-State Machines
Daniël Brand, P. Zafiropulo
Abstract
Open-access reader
Daniël Brand, P. Zafiropulo
Abstract
Open-access reader
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.
OpenAlex reports 1087 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: IBM, Citation, Watson, Research center, Computer science, State (computer science), Library science, Operating system