专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06912700B1 Method and system for non-linear state based satisfiability 失效
标题翻译：用于基于非线性状态的可满足性的方法和系统
公开(公告)号：US06912700B1
公开(公告)日：2005-06-28
申请号：US10164203
申请日：2002-06-06
申请人： John V. Franco , W. Mark VanFleet , John Schlipf , Michael R. Dransfield
发明人： John V. Franco , W. Mark VanFleet , John Schlipf , Michael R. Dransfield
IPC分类号： G06F7/60 , G06F17/10 , G06F17/11 , G06F17/50 , G06N5/04
CPC分类号： G06F17/11 , G06F17/504
摘要： A computerized method and system for solving non-linear Boolean equations is disclosed comprising at least partially solving a Boolean function; developing at least one inference regarding said Boolean function and saving said inference to a state machine; and accessing said inference from said state machine to develop at least one heuristic for determining whether said Boolean function is satisfiable.
摘要翻译：公开了一种用于求解非线性布尔方程的计算机化方法和系统，其包括至少部分地求解布尔函数; 开发关于所述布尔函数的至少一个推断并将所述推理保存到状态机; 以及从所述状态机访问所述推断以开发用于确定所述布尔函数是否可满足的至少一个启发式。

2. 发明授权

US07380224B2 Method and system for non-linear state based satisfiability 有权
标题翻译：用于基于非线性状态的可满足性的方法和系统
公开(公告)号：US07380224B2
公开(公告)日：2008-05-27
申请号：US11090647
申请日：2005-03-25
申请人： John V. Franco , W. Mark VanFleet , John Schlipf , Michael R. Dransfield
发明人： John V. Franco , W. Mark VanFleet , John Schlipf , Michael R. Dransfield
IPC分类号： G06F17/50
CPC分类号： G06F17/11 , G06F17/504
摘要： A computerized method and system for solving non-linear Boolean equations is disclosed comprising at least partially solving a Boolean function; developing at least one inference regarding said Boolean function and saving said inference to a state machine; and accessing said inference from said state machine to develop at least one heuristic for determining whether said Boolean function is satisfiable.
摘要翻译：公开了一种用于求解非线性布尔方程的计算机化方法和系统，其包括至少部分地求解布尔函数; 开发关于所述布尔函数的至少一个推断并将所述推理保存到状态机; 以及从所述状态机访问所述推断以开发用于确定所述布尔函数是否可满足的至少一个启发式。

3. 发明授权

US06190433B1 Method of recovering a gate-level netlist from a transistor-level 有权
标题翻译：从晶体管级恢复门级网表的方法
公开(公告)号：US06190433B1
公开(公告)日：2001-02-20
申请号：US09188387
申请日：1998-11-10
申请人： W. Mark Van Fleet , Michael R. Dransfield
发明人： W. Mark Van Fleet , Michael R. Dransfield
IPC分类号： G06F1710
CPC分类号： G06F17/5022
摘要： The present invention is a method of recovering a gate-level netlist from a transistor-level netlist by functionally describing each gate to be recovered using a first transistor model; generating a signature for each gate to be recovered; receiving the transistor-level netlist; selecting a set of connected components from the transistor-level netlist; functionally describing the set of connected components using the first transistor model; generating a signature for the set of connected components; comparing the signature of the set of connected components to the signature of each gate to be recovered; if the signature of the set of connected components matches a signature of a to be recovered then determining if the corresponding functional descriptions match; if a match occurs then functionally describing the set of connected components using a second transistor model; comparing the functional descriptions generated for the set of connected components using the first and second transistor models; identifying the set of connected components as a gate to be recovered if its signature and functional description match those of a gate to be recovered and the functional descriptions of the set of connected components based on the first and second transistor models match; and redoing these steps if there is another set of connected components that is unidentified or a gate-level description at a higher level of abstraction is desired.
摘要翻译：本发明是通过使用第一晶体管模型功能描述要恢复的每个栅极来从晶体管级网表恢复栅极级网表的方法; 为要恢复的每个门产生签名; 接收晶体管级网表; 从晶体管级网表选择一组连接的组件; 使用第一晶体管模型功能描述连接的组件集合; 为所述一组连接的组件生成签名; 将所连接的组件的签名与要恢复的每个门的签名进行比较; 如果连接的组件的签名与要恢复的签名匹配，则确定相应的功能描述是否匹配; 如果发生匹配，则使用第二晶体管模型功能地描述所连接的组件集合; 比较使用第一和第二晶体管模型为连接的组件组生成的功能描述; 如果其签名和功能描述与要恢复的门的签名和功能描述匹配，则将所连接的组件集合识别为要恢复的门，并且基于第一和第二晶体管模型匹配的连接组件的功能描述; 并且如果存在未识别的另一组连接的组件或希望在较高抽象级别的门级描述，则重新执行这些步骤。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式