Protocol verification using symbolic representations of queues

Details Protocol verification using symbolic representations of queues Protocol verification using symbolic representations of queues

1996-01-23

1998-06-16

DeCady, Albert

39518309, G06F 1100

Patent

active

057684987

ABSTRACT:
A finite symbolic representation of the states of an unbounded FIFO queue. Because the representation is protocol verification tools of the type which explore the state space of a protocol may be used to verify protocols which involve unbounded FIFO queues and consequently have an infinite state space. In a preferred embodiment, the finite symbolic representation is used together with a finite state automaton whose states are the global states of the protocol. A symbolic representation of the queue states is associated with each of the global states. State space exploration continues until all new queue states reached are already contained in the states of the finite symbolic representation. Increased processing speed is achieved by employing meta-transitions in the finite state automaton and exploring the meta-transitions from a global state before exploring the ordinary transitions.

REFERENCES:
patent: 4764863 (1988-08-01), Silverthorn
patent: 5299206 (1994-03-01), Beaverson
patent: 5513122 (1996-04-01), Cheng et al.
patent: 5574919 (1996-11-01), Netravali et al.
patent: 5615137 (1997-03-01), Holtmann
patent: 5659555 (1997-08-01), Lee et al.

Affiliated with

Also associated with

Rating

Protocol verification using symbolic representations of queues does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Protocol verification using symbolic representations of queues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Protocol verification using symbolic representations of queues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1737062