-
公开(公告)号：US07031896B1
公开(公告)日：2006-04-18
申请号：US09608856
申请日：2000-06-30
Applicant: Jin Yang
Inventor： Jin Yang
CPC classification number: G06F17/504
Abstract: Methods for formal verification of circuits and other finite-state systems are disclosed. Formal definitions and semantics are disclosed for a model of a finite-state system, an assertion graph to express properties for verification, and satisfiability criteria for specification and automated verification of forward implication properties and backward justification properties. A method is disclosed to perform antecedent strengthening on antecedent labels of an assertion graph.A method is also disclosed to compute a simulation relation sequence ending with a simulation relation fixpoint, which can be compared to a consequence labeling for each edge of an assertion graph to verify implication properties properties according to the formal semantics. An alternative method is disclosed to compute the simulation relation sequence from the strengthened antecedent labels of an assertion graph, thereby permitting automated formal verification of justification properties.Finally methods are disclosed to significantly reduce computation through abstraction of models and assertion graphs and to compute an implicit satisfiability of an assertion graph by a model from the simulation relation computed for the model and assertion graph abstractions. Other methods and techniques are also disclosed herein, which provide for fuller utilization of the claimed subject matter.
Abstract translation: 公开了电路和其他有限状态系统的形式验证方法。 对于有限状态系统的模型，用于表示验证属性的断言图形，以及前向暗示属性和后向对齐属性的规范和自动验证的可满足性标准，公开了正式定义和语义。 公开了对断言图的前提标签执行先行强化的方法。 还公开了一种用于计算以模拟关系固定点结尾的模拟关系序列的方法，其可以与断言图的每个边缘的后果标记进行比较，以根据形式语义来验证暗示属性属性。 公开了一种用于从断言图的强化先行标签计算模拟关系序列的替代方法，从而允许对称属性的自动形式验证。 最后披露了通过抽象模型和断言图来显着减少计算的方法，并且通过模型从为模型和断言图抽象计算的模拟关系计算断言图的隐式可满足度。 本文还公开了其他方法和技术，其提供了对所要求保护的主题的更全面的利用。
-
132.发明授权公开(公告)号：US07016679B2
公开(公告)日：2006-03-21
申请号：US09788933
申请日：2001-02-20
Applicant: Sudeep Kumar Palat , Hatef Yamini , Jin Yang
Inventor： Sudeep Kumar Palat , Hatef Yamini , Jin Yang
IPC: H04Q7/20
Abstract: A mobile telephone network provides a network operator domain in which the output from a radio network controller (RAN) is processed by a voice capable serving GPRS support mode (VC-SGSN). The VC-SGSN consists of the combination of a voice service box (VSB) and a service GPRS support node (SGSN). The VSB and the SGSN can jointly access the same home location register). The output of the SGSN can be forwarded to the internet via a gateway GPRS support node while the output of the VSB can be forwarded to the public switched telephone network (PSTN).
Abstract translation: 移动电话网络提供网络运营商域，其中来自无线电网络控制器（RAN）的输出由具有语音能力的服务GPRS支持模式（VC-SGSN）来处理。 VC-SGSN由语音服务盒（VSB）和业务GPRS支持节点（SGSN）的组合组成。 VSB和SGSN可以共同访问相同的归属位置寄存器）。 SGSN的输出可以通过网关GPRS支持节点转发到互联网，而VSB的输出可以转发到公共交换电话网（PSTN）。
-
公开(公告)号：US20050192789A1
公开(公告)日：2005-09-01
申请号：US11124315
申请日：2005-05-05
Applicant: Jin Yang
Inventor： Jin Yang
CPC classification number: G06F17/504
Abstract: Methods for formal verification of circuits and other finite-state systems are disclosed. Formal definitions and semantics are disclosed for a model of a finite-state system, an assertion graph to express properties for verification, and satisfiability criteria for specification and automated verification of forward implication properties and backward justification properties. A method is also disclosed to compute a simulation relation sequence ending with a simulation relation fixpoint, which can be compared to a consequence labeling for each edge of an assertion graph to verify implication properties and justification properties according to the formal semantics. A method for representing and verifying assertion graphs symbolically is disclosed that provides an effective alternative for verifying families of properties. A symbolic indexing function provides a way of identifying assignments to Boolean variables with particular scalar cases. Formally defining a class of lattice domains based on symbolic indexing functions, provides an efficient symbolic manipulation technique using BDDs. Other methods and techniques are also disclosed herein, which provide for fuller utilization of the claimed subject matter.
Abstract translation: 公开了电路和其他有限状态系统的形式验证方法。 对于有限状态系统的模型，用于表示验证属性的断言图形，以及前向暗示属性和后向对齐属性的规范和自动验证的可满足性标准，公开了正式定义和语义。 还公开了一种用于计算以模拟关系固定点结尾的模拟关系序列的方法，其可以与断言图的每个边缘的结果标记进行比较，以根据形式语义来验证暗示属性和对齐属性。 公开了用于表示和验证断言图的方法，其为验证属性族提供了有效的替代方案。 符号索引功能提供了一种识别具有特定标量情况的布尔变量赋值的方式。 基于符号索引功能正式定义一类晶格域，使用BDD提供了一种有效的符号操纵技术。 本文还公开了其他方法和技术，其提供了对所要求保护的主题的更全面的利用。
-
公开(公告)号：US06788675B1
公开(公告)日：2004-09-07
申请号：US09979812
申请日：2001-11-14
Applicant: Jin Yang
Inventor： Jin Yang
IPC: H04L1266
CPC classification number: H04M7/006 , H04L29/06 , H04L65/103 , H04L65/104 , H04L69/04 , H04L69/16 , H04L69/161 , H04L69/22 , H04L69/28 , H04W28/06
Abstract: In a wireless packet switching telecommunications network, voice services are provided by having a compressor/decompressor in each mobile station to provide each voice packet with a compressed header. Voice data and signalling data are sent separately and in different data formats to the air interface. The compressed header may be an M bit and a cyclically reset timeclick_number, which is decompressed by use of a wallclock which counts reset cycles to reinstate the voice packet headers. Alternatively, RTP agents are provided at the compression and decompression points, and voice packets are sent without headers over a “high quality” network such as a frame relay or ATM network. Compression state of a voice packet header can be established by sending call set-up information over an out-of-band channel between compression points in a mobile station and in die network.
Abstract translation: 在无线分组交换电信网络中，通过在每个移动站中具有压缩器/解压缩器来为每个语音分组提供压缩报头来提供语音服务。 语音数据和信令数据分别以不同的数据格式发送到空中接口。 压缩报头可以是M位和周期性复位的时间戳数，其通过使用计时复位周期来恢复语音分组报头的挂钟解压缩。 或者，在压缩和解压缩点处提供RTP代理，并且在诸如帧中继或ATM网络的“高质量”网络上发送没有报头的语音分组。 可以通过在移动台和模块网络中的压缩点之间的带外信道上发送呼叫建立信息来建立语音分组报头的压缩状态。
-
-
-
Search Results
134
records
(took 0.019 seconds)
