• DocumentCode
    2305568
  • Title

    Conformance testing of time-dependent protocols

  • Author

    Salinas, J. ; Park, N. ; Arunkumar, U. ; Lombardi, F.

  • Author_Institution
    Naval Undersea Warfare Center, New London, CT, USA
  • fYear
    1996
  • fDate
    21-25 Oct 1996
  • Firstpage
    257
  • Lastpage
    264
  • Abstract
    This paper presents an approach for verifying and validating time-dependent protocols, i.e. protocols for which the time spent for the functions is critical to a successful execution. The proposed approach is a novel modification of the traditional Unique Input/Output (UIO) method by explicitly taking into account the time specification of each edge in a protocol modeled as a finite state machine (FSM). A new FSM model which characterizes the timing properties of the protocol, is proposed. An algorithm which generates a test sequence with minimal traversal time for a time-dependent protocol in polynomial time complexity, is proposed
  • Keywords
    communication complexity; computational complexity; conformance testing; finite state machines; formal verification; protocols; conformance testing; finite state machine; polynomial time complexity; test sequence; time specification; time-dependent protocols; timing properties; validating; verifying; Automata; Character generation; Computer science; Formal verification; Logic testing; Polynomials; Protocols; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Engineering of Complex Computer Systems, 1996. Proceedings., Second IEEE International Conference on
  • Conference_Location
    Montreal, Que.
  • Print_ISBN
    0-8186-7614-0
  • Type

    conf

  • DOI
    10.1109/ICECCS.1996.558422
  • Filename
    558422