Testing a data-processing system with telecommunications endpoints
    1.
    发明授权
    Testing a data-processing system with telecommunications endpoints 有权
    使用电信端点测试数据处理系统

    公开(公告)号:US07583792B2

    公开(公告)日:2009-09-01

    申请号:US11176816

    申请日:2005-07-07

    IPC分类号: H04M1/24 H04M3/08 H04M3/22

    摘要: A method and apparatus are disclosed that provide a technique for testing a data-processing system that enables communications between two or more telecommunications endpoints. An example of such a data-processing system is a Session-Initiation Protocol (SIP) proxy server. In particular, a test-execution system, in accordance with the illustrative embodiment of the present invention, transmits test-related signals to and receives test-related signals from one or more endpoints, such as SIP-enabled telephones. Some of the transmitted test-related signals direct an endpoint to transmit a message, such as a session-initiation request, to the data-processing system under test. Some of the received test-related signals comprise information from an endpoint, such as whether or not a message has been received from the data-processing system under test. Instead of communicating with the data-processing system itself, the test-execution system of the illustrative embodiment enlists the telecommunications endpoints to interact with the data-processing system.

    摘要翻译: 公开了提供一种用于测试能够实现两个或更多个电信端点之间的通信的数据处理系统的技术的方法和装置。 这种数据处理系统的一个例子是会话发起协议(SIP)代理服务器。 特别地,根据本发明的说明性实施例的测试执行系统将测试相关信号发送到一个或多个端点(例如支持SIP的电话)并接收与测试相关的信号。 一些发送的测试相关信号指示端点将诸如会话发起请求的消息发送到被测数据处理系统。 所接收的测试相关信号中的一些包括来自端点的信息,例如是否已经从被测数据处理系统接收到消息。 代替与数据处理系统本身通信,说明性实施例的测试执行系统使电信端点与数据处理系统交互。

    Optimal test generation for finite state machine models
    2.
    发明授权
    Optimal test generation for finite state machine models 失效
    有限状态机模型的最优测试生成

    公开(公告)号:US4991176A

    公开(公告)日:1991-02-05

    申请号:US362724

    申请日:1989-06-07

    摘要: Faster, yet, completely efficient and exhaustive testing is afforded an entity (e.g., protocol, VLSI circuit, software application) represented as finite state machines by employing the present method in which test sequences are generated according to minimum cost function rules. Minimum cost unique signatures are developed for state identification of the finite state machine. Based upon the minimum cost unique signatures, a minimum cost test sequence is generated to cover every state transition of the finite state machine. As a result, every testable aspect of the entity is guaranteed to be tested using a minimum number of steps which represents a considerable cost savings.

    摘要翻译: 通过采用根据最小成本函数规则生成测试序列的本方法,为更为快速而又完整有效且详尽的测试提供了表示为有限状态机的实体(例如协议,VLSI电路,软件应用)。 开发有限状态机的状态识别的最小成本独特签名。 基于最小成本独特签名,生成最小成本测试序列以覆盖有限状态机的每个状态转换。 因此,实体的每个可测试方面都被保证使用最少数量的步骤进行测试,这样可以显着节省成本。

    Method for synchronizing interconnected digital equipment
    3.
    发明授权
    Method for synchronizing interconnected digital equipment 失效
    用于同步互连数字设备的方法

    公开(公告)号:US5068877A

    公开(公告)日:1991-11-26

    申请号:US503205

    申请日:1990-04-02

    IPC分类号: H04L7/00 G06F1/14 H04J3/06

    CPC分类号: H04J3/0679

    摘要: Optimized synchronization planning and clock distribution for a network of interconnected digital equipment is achieved by designating a network node at the highest stratum level as the master clock node, forming a group of all unassigned nodes connected to the assigned node or nodes, selecting subgroup of all nodes from the group wherein the subgroup includes all nodes having the highest stratum level of the group, limiting the subgroup to the nodes which have a desired characteristic when such nodes are included in the subgroup, determining the synchronization performance of each node in the subgroup according to a predetermined criterion, assigning one node from the subgroup as a clock timing receiver wherein the one node exhibits the best performance for nodes in the subgroup, and iterating the method at the forming step. In order to obtain an optimum synchronization plan, it is desirable to repeat the entire method described above for the complete set of nodes which are capable of being designated as a master clock node. When more than one node is capable of being considered as a master clock node, the synchronization planning method is then completed by computing the network synchronization performance for each synchronization plan related to a different designated master clock node and choosing the synchronization plan which offers the best network synchronization performance as computed above.