Reachability problems for communicating finite state machines

Details Reachability problems for communicating finite state machines Reachability problems for communicating finite state machines

2003-06-22

arxiv.org/abs/cs/0306121v2

Computer Science

Logic in Computer Science

University of Waterloo, Department of Computer Science Research Report; May 1982; 66 pages, 24 figures; formatted for arXiv: J

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Reachability problems for communicating finite state machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reachability problems for communicating finite state machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reachability problems for communicating finite state machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154119