To correct communicating finite state machines
Pages 327 - 334
Abstract
A number of methods have been proposed to validate the communication between processes which exchange messages through bounded FIFO channels. However design criteria and rules are developed to construct correct protocols. In this paper, our objective is to propose a new correcting method for a pair of communicating finite state machines and we ensure that the communication is perfect and progresses indefinitely i.e deadlock-free, liveness, bounded, and without noexecutable transitions, unspecified receptions. The time complexity is bounded by O(nm) where n is the number of states and m is the number of transitions of a given machine. The first method is defined by adding receiving transitions and in the second we complete our results by adding sending transitions, then we obtain symmetric and isomorphic machines with unbounded communication.
References
[1]
D. Brand, P. Zafiropulo" On communicating finite machines", Journal ACM 30, pp 323-342, 1983.
[2]
G. Bochmann "Finite state descriptions of communication protocols", Computer networks, pp 361-372, october 1978.
[3]
G. Bochmann, M. Merlin "On the construction communication protocols", Proc. 5 thlnt. Conf. Comp.com., Atlanta, GA, Edt. North-Holland pp 371-378,1980.
[4]
E. Dijkstra" Solution of a problem in concurrent programming contror', Communication of the vol 8,no 9,pp 569, september 1965.
[5]
S. Dong "The modeling, analysis and synthesis communication protocols", Thesis Ph.D of University of California, Berkely, 83.
[6]
M. Gouda, C. Chang "A technique for proving communicating finite state machines with examples", ACM symposium on principles of distributed august 1984.
[7]
M. Gouda, Y. Yu " Synthesis of communicating finite-state machines with guaranteed progress", trans. Cornmun., vol. COM-32, pp 779-788, July 1984.
[8]
H. Mountassir, R. Sijelmassi "Formulation syntaxique la communication de processus asynchrones a travers des canaux FIFO", A paraitre dans Rairo,1988.
[9]
H. Mountassir" Correction lintaire de protocoles communication", Rapp. interne, Universit6 de Juillet 88 soumis a publication.
[10]
H. Mountassir" On basic rewriting rules communicating machines", symposium on future distributed computing systems (DCCS'90), Hong-Kong (sept. 1988).
[11]
C. Jard, M. Raynal "De la nectssit6 de la sptcification proprittts pour des algorithmes distributs" Rapp. IRISA de Rennes, 1986.
[12]
D. Sidhu "Rules for synthesizing correct communications protocols", ACM Comp.Comm. Rev. vol 12,no{13}
[13]
C. West et al. "A general technique for commmnication control validation", IBM J. Res. Develop. vol July 1978.
[14]
P. Zafiropulo et al. "Towards analyzing and synthesizing protocols", IEEE transactions on communication, vol COM 28, pp 651-661, april 1980.
Recommendations
Priority Networks of Communicating Finite State Machines
Consider a network of two communicating finite state machines which exchange messages over two one-directional, unbounded channels, and assume that each machine receives the messages from its input channel based on some fixed (partial) priority relation. ...
Lossy Communicating Finite State Machines
A network of communicating finite state machines (CFSM) consists of a set of finite state machines that communicate asynchronously with each other over (potentially) unbounded FIFO channels by sending and receiving typed messages. As a concurrency model,...
Deadlock detection in communicating finite state machines by even reachability analysis
Special issue: protocols for mobile environmentsA network of communicating finite state machines (CFSM) consists of a set of finite state machines which communicate asynchronously with each other over (potentially) unbounded FIFO channels by sending and receiving typed messages. As a concurrency ...
Comments
Information & Contributors
Information
Published In
Copyright © 1989 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 21 February 1989
Check for updates
Qualifiers
- Article
Conference
ICMI05
Sponsor:
ICMI05: Seventh International Conference on Multimodal Interfaces 2005
February 21 - 23, 1989
Kentucky, Louisville
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 333Total Downloads
- Downloads (Last 12 months)31
- Downloads (Last 6 weeks)7
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in