Advertisement

A verification procedure via invariant for extended communicating finite-state machines

  • Masahiro Higuchi
  • Osamu Shirakawa
  • Hiroyuki Seki
  • Mamoru Fujii
  • Tadao Kasami
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 663)

Abstract

This paper presents a method for verifying safety property of a communication protocol modeled as two extended communicating finite-state machines with two unbounded FIFO channels connecting them. In this method, four types of atomic formulae specifying a condition on a machine and a condition on a sequence of messages in a channel are introduced. A human verifier describes a logical formula which expresses conditions expected to be satisfied by all reachable global states, and a verification system proves that the formula is indeed satisfied by such states (i.e. the formula is an invariant) by induction. If the invariant is never satisfied in any unsafe state, it can be concluded that the protocol is safe. To show the effectiveness of this method, a sample protocol extracted from the data transfer phase of the OSI session protocol was verified by using the verification system.

Keywords

Regular Expression Global State Transitive Closure Logical Formula Inclusion Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Brand D., and Zafiropulo P.: “On Communicating Finite-State Machines”, Journal of ACM, vol.30, pp.323–342, 1983–04.Google Scholar
  2. 2.
    Kakuda Y., Wakahara Y., and Norigoe M.: “A New Algorithm for Fast Protocol Validation”, Proc. of Compsac-86, pp.228–236, 1986.Google Scholar
  3. 3.
    Yuang M.C., and Kershebaum A.: “Parallel Protocol Verification: The Two-Phase Algorithm”, Proc. 9th Intern. Symp. on PSTV, pp.339–353, 1989.Google Scholar
  4. 4.
    ISO: “Information Processing Systems-Open Systems Interconnection-Estelle: A Formal Description Technique Based on an Extended State Transition Model”, ISO/DIS 9074, 1987.Google Scholar
  5. 5.
    CCITT: “Specification and Description Language(SDL)”, Recommendation Z100, 1989.Google Scholar
  6. 6.
    Gordon M.J.C.: “A Proof Generating System for Higher-Order Logic” in “VLSI Specification, Verification and Synthesis”, Kluwer Academic Publishers, pp.73–128, 1987-01.Google Scholar
  7. 7.
    Sarikaya B., Bochmann G.V., and Koukoulidis V.: “Method of Analysing Extended Finite-State Machine Specifications”, Computer Communications, vol.13, no.2, pp.83–92, 1990–03.Google Scholar
  8. 8.
    Finkel A.: “A New Class of Analyzable CFSMs with Unbounded FIFO Channels”, Proc. 8th Intern. Symp. on PSTV, pp.283–294, 1988.Google Scholar
  9. 9.
    Huet G., and Oppen D.:“Equations and Rewrite Rules A Survey” in “Formal Language: Perspectives and Open Problems”, R. Book eds., Academic Press, pp.349–405, 1980.Google Scholar
  10. 10.
    ISO: “Basic Connection Oriented Session Protocol Specification”, ISO 8327.Google Scholar
  11. 11.
    Higuchi M., Seki H., and Kasami T.: “A Method of Composing Communication Protocols with Priority Service”, to appear in IEICE Trans. Commun., 1992-10.Google Scholar
  12. 12.
    Choi T.Y., and Miller R.E.: “A Decomposition Method for the Analysis and Design of Finite State Protocols”, Proc. of 8th ACM/IEEE Data Comm. Symp., pp.167–176, 1983.Google Scholar
  13. 13.
    Lin H.: “Constructing Protocols with Alternative Functions”, IEEE Trans. Comput., vol.40, pp.376–386, 1991-04.Google Scholar
  14. 14.
    Chow C., Gouda M.G., and Lam S.S.: “A Discipline for Constructing Multiphase Communication Protocols”, ACM Trans. on Computer Systems, vol.3, pp.315–343, 1985-11.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Masahiro Higuchi
    • 1
  • Osamu Shirakawa
    • 1
  • Hiroyuki Seki
    • 1
  • Mamoru Fujii
    • 2
  • Tadao Kasami
    • 3
  1. 1.Dept. of Information and Computer SciencesOsaka UniversityOsakaJapan
  2. 2.College of General EducationOsaka UniversityOsakaJapan
  3. 3.Advanced Institute of Science and TechnologyNaraJapan

Personalised recommendations