Method for thinning a protocol

Claim 1

A method of simplifying control of a subset of services in a communications process in accordance with a specific set of rules, said specific set of rules comprising a subset of a complex set of rules, said specific set of rules being generated by the steps of: (a) storing first signals representative of said complex set of rules, wherein said first signals characterize a finite state machine representation of said complex set of rules and wherein said first signals comprise signals characterizing states and signals characterizing edges representing input/output operations and internal and external transitions between said states in said finite said machine representation; (b) storing second signals representative of a set of rules for a subset of services, wherein said second signals comprise signals characterizing edges representing service primitives of a finite state machine representation of said set of rules for said subset of services; (c) comparing said first signals to said second signals and deleting from said first signals a first set of signals characterizing edges with no match in said second signals; (d) selecting from said first signals a second set of signals representative of said specific set of rules, wherein said second set of signals characterize a strongly connected graph; and (e) repeating steps (c) and (d) until said second set of signals characterize only a strongly connected graph with no unmatched edges.

Claim 2

A method of simplifying control of a subset of services in a communications process in accordance with a specific set of rules, said specific set of rules comprising a subset of a complex set of rules, said specific set of rules being generated by the steps of: (a) storing first signals representative of said complex set of rules, wherein said first signals characterize a finite state machine representation of said complex set of rules and wherein said first signals comprise signals characterizing states and signals characterizing edges representing input/output operations and internal and external transitions between said states in said finite said machine representation; (b) storing second signals representative of a set of rules for a subset of services, wherein said second signals comprise signals characterizing edges representing service primitives of a finite state machine representation of said set of rules for said subset of services; (c) comparing said first signals to said second signals and deleting from said first signals a first set of signals characterizing edges with no match in said second signals; (d) selecting from said first signals a second set of signals representative of said specific set of rules, wherein said second set of signals characterize a strongly connected graph; and (e) repeating steps (c) and (d) until said second set of signals characterize only a strongly connected graph with no unmatched edges.

Claim 3

A method for reducing the complexity of a protocol, wherein said protocol generates a set of signals to regulate communications between peer layers in a computer network, wherein said protocol also generates signals for executing a plurality of services, and wherein only a desired subset of services of said plurality of services is required, said method comprising the steps of: (a) generating a first finite state machine representations of said protocol and of said desired subset of services, wherein each of said representations comprises states and edges, wherein said edges represent input/output operations and internal and external transitions between said states and wherein each of said representations has an initial state; (b) deleting edges in said protocol finite state machine representation which do not correspond to edges of said finite state machine representation of said desired subset of services to yield a second finite state machine representation of said protocol; (c) determining a set of strongly connected edges of a finite state machine representation of said protocol equal to a strongly connected component of the second finite state machine representation which contains the initial state; (d) removing from said second finite machine representation of said protocol edges not within said set of strongly connected edges; and (e) repeating steps (b) through (d) until said second finite state machine representation of said protocol comprises a strongly connected component comprising the initial state and edges which are strongly connected.

Claim 4

A method for reducing the complexity of a protocol, wherein said protocol generates a set of signals to regulate communications between peer layers in a computer network, wherein said protocol also generates signals for executing a plurality of services, and wherein only a desired subset of services of said plurality of services is required, said method comprising the steps of: (a) generating a first finite state machine representations of said protocol and of said desired subset of services, wherein each of said representations comprises states and edges, wherein said edges represent input/output operations and internal and external transitions between said states and wherein each of said representations has an initial state; (b) deleting edges in said protocol finite state machine representation which do not correspond to edges of said finite state machine representation of said desired subset of services to yield a second finite state machine representation of said protocol; (c) determining a set of strongly connected edges of a finite state machine representation of said protocol equal to a strongly connected component of the second finite state machine representation which contains the initial state; (d) removing from said second finite machine representation of said protocol edges not within said set of strongly connected edges; and (e) repeating steps (b) through (d) until said second finite state machine representation of said protocol comprises a strongly connected component comprising the initial state and edges which are strongly connected.

Claim 5

A method for reducing the complexity of a protocol, wherein said protocol generates a set of signals to regulate communications between peer layers in a computer network, wherein said protocol also generates signals for executing a plurality of services, and wherein only a desired subset of services of said plurality of services is required, said method comprising the steps of: storing first signals representative of a finite state of machine representation of said protocol and second signals representative of said desired subset of services, wherein each of said representation comprises edges and states, wherein said edges represent input/output operations and internal and external transitions between said states; generating third signals representative of the composition of said protocol and of said desired subset of services; and deleting from said third signals a set of signals representative of edges in said composition not exercised in forming said composition to form said subset of services.

Claim 6

A method for reducing the complexity of a protocol, wherein said protocol generates a set of signals to regulate communications between peer layers in a computer network, wherein said protocol also generates signals for executing a plurality of services, and wherein only a desired subset of services of said plurality of services is required, said method comprising the steps of: storing first signals representative of a finite state of machine representation of said protocol and second signals representative of said desired subset of services, wherein each of said representation comprises edges and states, wherein said edges represent input/output operations and internal and external transitions between said states; generating third signals representative of the composition of said protocol and of said desired subset of services; and deleting from said third signals a set of signals representative of edges in said composition not exercised in forming said composition to form said subset of services.

Claim 7

An apparatus comprising a memory which contains code for implementing a subset of services in a communications process in accordance with a specific set of rules, said specific set of rules comprising a subset of a complex set of rules, said specific set of rules having been generated by the steps of: (a) storing first signals representative of said complex set of rules, wherein said first signals characterize a finite state machine representation of said complex set of rules and wherein said first signals comprise signals characterizing states and signals characterizing edges representing input/output operations and internal and external transitions between said states in said finite said machine representation; (b) storing second signals representative of a set of rules for a subset of services, wherein said second signals comprise signals characterizing edges representing service primitives of a finite state machine representation of said set of rules for said subset of services; (c) comparing said first signals to said second signals and deleting from said first signals a first set of signals characterizing edges with no match in said second signals; (d) selecting from said first signals a second set of signals representative of said specific set of rules, wherein said second set of signals characterize a strongly connected graph; and (e) repeating steps (c) and (d) until said second set of signals characterize only a strongly connected graph with no unmatched edges.

Claim 8

An apparatus comprising a memory which contains code for implementing a subset of services in a communications process in accordance with a specific set of rules, said specific set of rules comprising a subset of a complex set of rules, said specific set of rules having been generated by the steps of: (a) storing first signals representative of said complex set of rules, wherein said first signals characterize a finite state machine representation of said complex set of rules and wherein said first signals comprise signals characterizing states and signals characterizing edges representing input/output operations and internal and external transitions between said states in said finite said machine representation; (b) storing second signals representative of a set of rules for a subset of services, wherein said second signals comprise signals characterizing edges representing service primitives of a finite state machine representation of said set of rules for said subset of services; (c) comparing said first signals to said second signals and deleting from said first signals a first set of signals characterizing edges with no match in said second signals; (d) selecting from said first signals a second set of signals representative of said specific set of rules, wherein said second set of signals characterize a strongly connected graph; and (e) repeating steps (c) and (d) until said second set of signals characterize only a strongly connected graph with no unmatched edges.

Claim 9

An apparatus comprising a memory which contains code for implementing a desired subset of services in a plurality of services, wherein said plurality of services are executed by signals generated by a protocol for regulating communications between peer layers in a computer network, said desired subset of services having been generated by the steps of: (a) generating a first finite state machine representations of said protocol and of said desired subset of services, wherein each of said representations comprises states and edges, wherein said edges represent input/output operations and internal and external transitions between said states and wherein each of said representations has an initial state; (b) deleting edges in said protocol finite state machine representation which do not correspond to edges of said finite state machine representation of said desired subset of services to yield a second finite state machine representation of said protocol; (c) determining a set of strongly connected edges of a finite state machine representation of said protocol equal to a strongly connected component of the second finite state machine representation which contains the initial state; (d) removing from said second finite machine representation of said protocol edges not within said set of strongly connected edges; and (e) repeating steps (b) through (d) until said second finite state machine representation of said protocol comprises a strongly connected component comprising the initial state and edges which are strongly connected.

Claim 10

An apparatus comprising a memory which contains code for implementing a desired subset of services in a plurality of services, wherein said plurality of services are executed by signals generated by a protocol for regulating communications between peer layers in a computer network, said desired subset of services having been generated by the steps of: (a) generating a first finite state machine representations of said protocol and of said desired subset of services, wherein each of said representations comprises states and edges, wherein said edges represent input/output operations and internal and external transitions between said states and wherein each of said representations has an initial state; (b) deleting edges in said protocol finite state machine representation which do not correspond to edges of said finite state machine representation of said desired subset of services to yield a second finite state machine representation of said protocol; (c) determining a set of strongly connected edges of a finite state machine representation of said protocol equal to a strongly connected component of the second finite state machine representation which contains the initial state; (d) removing from said second finite machine representation of said protocol edges not within said set of strongly connected edges; and (e) repeating steps (b) through (d) until said second finite state machine representation of said protocol comprises a strongly connected component comprising the initial state and edges which are strongly connected.

Claim 11

An apparatus comprising a memory which contains code for implementing a desired subset of services in a plurality of services, wherein said plurality of services are executed by signals generated by a protocol for regulating communications between peer layers in a computer network, said desired subset of services having been generated by the steps of: storing first signals representative of a finite state of machine representation of said protocol and second signals representative of said desired subset of services, wherein each of said representation comprises edges and states, wherein said edges represent input/output operations and internal and external transitions between said states; generating third signals representative of the composition of said protocol and of said desired subset of services; and deleting from said third signals a set of signals representative of edges in said composition not exercised in forming said composition to form said subset of services.

Claim 12

An apparatus comprising a memory which contains code for implementing a desired subset of services in a plurality of services, wherein said plurality of services are executed by signals generated by a protocol for regulating communications between peer layers in a computer network, said desired subset of services having been generated by the steps of: storing first signals representative of a finite state of machine representation of said protocol and second signals representative of said desired subset of services, wherein each of said representation comprises edges and states, wherein said edges represent input/output operations and internal and external transitions between said states; generating third signals representative of the composition of said protocol and of said desired subset of services; and deleting from said third signals a set of signals representative of edges in said composition not exercised in forming said composition to form said subset of services.