Reachability problems for communicating finite state machines
Logic in Computer Science
2012-03-21 v2 Networking and Internet Architecture
Abstract
The paper deals with the verification of reachability properties in a commonly used state transition model of communication protocols, which consists of finite state machines connected by potentially unbounded FIFO channels. Although simple reachability problems are undecidable for general protocols with unbounded channels, they are decidable for the protocols with the recognizable channel property. The decidability question is open for the protocols with the rational channel property.
Keywords
Cite
@article{arxiv.cs/0306121,
title = {Reachability problems for communicating finite state machines},
author = {Jan Pachl},
journal= {arXiv preprint arXiv:cs/0306121},
year = {2012}
}
Comments
University of Waterloo, Department of Computer Science Research Report; May 1982; 66 pages, 24 figures; formatted for arXiv: June 2003; arXiv v2 (corrected typos): March 2012