article

Free access

Decidability of a class of dual communicating finite state machines

Author:

H. MountassirAuthors Info & Claims

ACM SIGOPS Operating Systems Review, Volume 30, Issue 3

Pages 59 - 66

https://doi.org/10.1145/230908.230920

Published: 01 July 1996 Publication History

PDF eReader

Abstract

A number of techniques have been proposed to validate systems of communicating machines which exchange exclusively messages through FIFO channels. The reachability analysis is a well-known and most popular technique implemented in several tools of validation. Two majors questions are discussed : the finiteness of the reachability graph and the state explosion problem. In this paper we clarify a restricted class of dual machines and its applicability of real protocols. Our investigation at the first time concern sufficient conditions to ensure the finiteness of the reachability graph. In the second part of the paper we confirm the results using the fair reachability analysis in which global states are generated by forcing the two machines in equal speeds.

References

[1]

[1] D. Brand, M. Zafiropulo, "On communicating finite state machines", Journal ACM 30, pp. 323-342, 1983.

Digital Library

Google Scholar

[2]

[2] G. Bochmann, "Finite state descriptions of communication protocols", Computer Networks, pp. 361-372, october 1978.

Google Scholar

[3]

[3] L. Cacciari, O. Rafiq, "Decidability issues in Reduced Reachability Analysis", Int. Conf. on Network Protocols, San Francisco, October 1993.

Google Scholar

[4]

[4] A. Finkel, "A New class of analysable CFSM with unbounded FIFO channels", VIII IFIP Sym., Atlantic city, 1988.

Google Scholar

[5]

[5] M. Gouda, Y. Yu, "Protocol validation by fair progress state exploration", Comp. Networks and ISDN systems 9, 1985.

Google Scholar

[6]

[6] G. Holzmann, "Design and validation of computer protocols", Prentice Hall, 1991.

Digital Library

Google Scholar

[7]

[7] M. Itoh and H. Ichicawa, "Protocol verification algorithm using reduced reachability analysis", Trans. IECE Japan, vol. E66, No. 2, pp. 88-93, February 1983.

Google Scholar

[8]

[8] T. Jéron, C. Jard, "Testing for unboundedness of FIFO channels", Th. Com. Sc., Vol. 113, p. 93-117, 1993.

Digital Library

Google Scholar

[9]

[9] H. Mountassir, "On unboundedness in Reduced Reachability graphs", The IEEE proc. Intern. Conf. Distr. Paral. Systems, Las Vegas, USA, 1994.

Google Scholar

[10]

[10] J. Rubin, H. West, "An Improved protocol validation technique", Computer Networks 6, 1982.

Google Scholar

[11]

[11] M. Zafiropulo et. al., "Towards analyzing and synthesizing protocols", IEEE transactions on communication, vol. COM 28, pp. 651-661, april 1980.

Google Scholar

[12]

[12] Zaho and G. Bochmann, "Reduced reachability analysis of communication protocols: A new approach", Publication No. 750, Dept. d'IRO, Université de Montréal, (1986).

Google Scholar

Index Terms

Decidability of a class of dual communicating finite state machines
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Concurrency control
2. Theory of computation
  1. Formal languages and automata theory
  2. Models of computation
    1. Concurrency
      1. Parallel computing models

Recommendations

Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method

Presents a method of generating test sequences for concurrent programs and communication protocols that are modeled as communicating nondeterministic finite-state machines (CNFSMs). A conformance relation, called trace-equivalence, is defined within ...
New Decidability Results Concerning Two-Way Counter Machines

The authors study some decision questions concerning two-way counter machines and obtain the strongest decidable results to date concerning these machines. In particular, it is shown that the emptiness, containment, and equivalence (ECE, for short) ...
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. ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGOPS Operating Systems Review

ACM SIGOPS Operating Systems Review Volume 30, Issue 3

July 1996

80 pages

ISSN:0163-5980

DOI:10.1145/230908

Chairman:
Carla Ellis
Duke Univ., Durham, NC
,
Editor:
William M. Waite
Univ. of Colorado, Boulder

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1996

Published in SIGOPS Volume 30, Issue 3

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
160
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Index Terms

Recommendations

Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method

New Decidability Results Concerning Two-Way Counter Machines

Priority Networks of Communicating Finite State Machines

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations