By Topic

Language-based analysis of communicating finite state machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Huus, J. ; Simware, Inc., Ottawa, Ont., Canada ; Ural, H.

The authors present an efficient method for extracting a behavior description of a process (communicating finite state machine), as constrained by a given protocol. In the case where the constrained behavior corresponds to the unconstrained behavior depicted by the process specification, the process is said to be effective. The authors call the derived behavior description a process event graph (PEG). By comparing the PEG with the process specification, they determine whether a process in a protocol is effective. Two extensions to the basic algorithm are given, one to introduce parallelism to reachability analysis and one to detect traces that lead to process blockage. The authors focus initially on the two-process case, and then consider implications of more general protocols

Published in:

Network Protocols, 1993. Proceedings., 1993 International Conference on

Date of Conference:

19-22 Oct 1993