Name
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 |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/ICECCS.1996.558422 | ICECCS |
Keywords | Field | DocType |
protocols,finite state machine,formal verification,conformance testing,automata,input output,communication complexity,computational complexity,computer science,polynomial time,finite state machines,polynomials | Tree traversal,Polynomial,Computer science,Automaton,Algorithm,Conformance testing,Communication complexity,Real-time computing,Finite-state machine,Computational complexity theory,Formal verification | Conference |
ISBN | Citations | PageRank |
0-8186-7614-0 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Salinas, J. | 1 | 0 | 0.34 |
| N. Park | 2 | 39 | 7.43 |
| Arunkumar, U. | 3 | 0 | 0.34 |
| F. Lombardi | 4 | 232 | 24.13 |