US2006074619A1PendingUtilityA1

Recognizing signals in design simulation

Assignee: INTEL CORPPriority: Dec 27, 2000Filed: Nov 21, 2005Published: Apr 6, 2006
Est. expiryDec 27, 2020(expired)· nominal 20-yr term from priority
G06F 30/33
42
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A transaction rule is used to recognize a set of simulation signals obtained from a design simulation as a transaction. An action associated with the transaction rule is executed to produce an output identifying the transaction.

Claims

exact text as granted — not AI-modified
1 - 27 . (canceled)  
   
   
       28 . A method comprising: 
 receiving simulation signals from a design simulation;    applying a transaction rule to recognize a first set of the simulation signals as a transaction; and    applying an atomic rule to recognize a second set of the simulation signals.    
   
   
       29 . The method according to  claim 28  further comprising: 
 successively defining the transaction rule using other rules so that the transaction rule is defined by the simulation signals.    
   
   
       30 . The method according to  claim 28  further comprising: 
 applying a non-atomic rule to recognize a first set of atomic rules; and    applying the transaction rule to recognize a second set of atomic rules and a set of non-atomic rules as the transaction corresponding to the transaction rule.    
   
   
       31 . The method according to  claim 28  further comprising: 
 placing in a data structure one or more symbols corresponding to an atomic rule associated with the simulation signals;    replacing in the data structure the one or more symbols corresponding to atomic rules with one or more symbols corresponding to a non-atomic rule; and    replacing the one or more symbols corresponding to non-atomic rules and the one or more symbols corresponding to atomic rules with one or more symbols corresponding to the transaction rule.    
   
   
       32 . A method comprising: 
 defining a first transaction rule by non-atomic rules;    defining one or more atomic rules in terms of one or more simulation signals.    
   
   
       33 . The method according to  claim 32  further comprising: 
 placing in a data structure a symbol corresponding to an atomic rule associated with the simulation signals;    replacing in the data structure one or more symbols corresponding to atomic rules with a symbol corresponding to a non-atomic rule; and    replacing one or more symbols corresponding to non-atomic rules and one or more symbols corresponding to atomic rules with a symbol corresponding to the first transaction rule.    
   
   
       34 . The method according to  claim 32  further comprising: 
 defining a second transaction rule to recognize a permutation of the atomic rules as the transaction.    
   
   
       35 . An article comprising a computer-readable medium that stores computer-executable instructions for causing a computer system to: 
 receive simulation signals from a design simulation;    apply a transaction rule to recognize a first set of the simulation signals as a transaction; and    apply an atomic rule to recognize a second set of the simulation signals.    
   
   
       36 . The article according to  claim 35  further including instruction for causing the computer system to: 
 successively define the transaction rule with other rules so that the transaction rule is defined by the simulation signals.    
   
   
       37 . The article according to  claim 35  further including instruction for causing the computer system to: 
 apply a non-atomic rule to recognize a first set of atomic rules; and    apply the transaction rule to recognize a second set of atomic rules and a set of non-atomic rules as the transaction corresponding to the transaction rule.    
   
   
       38 . The article according to  claim 35  further including instruction for causing the computer system to: 
 place in a data structure one or more symbol corresponding to an atomic rule associated with the simulation signals;    replace in the data structure the one or more symbols corresponding to atomic rules with one or more corresponding to a non-atomic rule; and    replace the one or more symbols corresponding to non-atomic rules and the one or more symbols corresponding to atomic rules with one or more symbols corresponding to the transaction rule.    
   
   
       39 . An article comprising a computer-readable medium that stores computer-executable instructions for causing a computer system to: 
 define a first transaction rule by non-atomic rules; and    define one or more atomic rules in terms of one or more simulation signals.    
   
   
       40 . The article according to  claim 39  further including instruction for causing the computer system to: 
 place in a data structure a symbol corresponding to an atomic rule associated with the simulation signals;    replace in the data structure one or more symbols corresponding to atomic rules with a symbol corresponding to a non-atomic rule; and    replace one or more symbols corresponding to non-atomic rules and one or more symbols corresponding to atomic rules with a symbol corresponding to the transaction rule.    
   
   
       41 . The article according to  claim 39  further including instruction for causing the computer system to: 
 define a second transaction rule to recognize a permutation of the atomic rules as the transaction.    
   
   
       42 . An apparatus comprising: 
 a processor to:    receive simulation signals;    apply a transaction rule to recognize a first set of the simulation signals as a transaction; and    apply an atomic rule to recognize a second set of the simulation signals.    
   
   
       43 . The apparatus according to  claim 42  wherein the processor is further configured to: 
 successively define the transaction rule with other rules so that the transaction rule is defined by the simulation signals.    
   
   
       44 . The apparatus according to  claim 42  wherein the processor is to: 
 apply a non-atomic rule to recognize a first set of atomic rules; and    apply the transaction rule to recognize a second set of atomic rules and a set of non-atomic rules as the transaction corresponding to the transaction rule.    
   
   
       45 . The apparatus according to  claim 42  wherein the processor is to: 
 place in a data structure one or more symbols corresponding to an atomic rule associated with the simulation signals;    replace in the data structure the one or more symbols corresponding to atomic rules with one or more corresponding to a non-atomic rule; and    replace the one or more symbols corresponding to non-atomic rules and the one or more symbols corresponding to atomic rules with one or more symbols corresponding to the transaction rule.    
   
   
       46 . An apparatus comprising: 
 a processor to:    receive simulation signals;    define a first transaction rule by non-atomic rules; and    define one or more atomic rules in terms of one or more simulation signals.    
   
   
       47 . The apparatus according to  claim 46  wherein the processor is to: 
 place in a data structure a symbol corresponding to an atomic rule associated with the simulation signals;    replace in the data structure one or more symbols corresponding to atomic rules with a symbol corresponding to a non-atomic rule; and    replace one or more symbols corresponding to non-atomic rules and one or more symbols corresponding to atomic rules with a symbol corresponding to the transaction rule.    
   
   
       48 . The apparatus according to  claim 46  wherein the processor is further configured to: 
 define a second transaction rule to recognize a permutation of the atomic rules as the transaction.    
   
   
       49 . A method comprising: 
 determining whether an atomic rule applies to a simulation signal;    placing in a data structure a first symbol corresponding to the atomic rule; and    applying a non-atomic rule to the first symbol.    
   
   
       50 . The method of  claim 49 , comprising: 
 comparing the first symbol to the second symbol.    
   
   
       51 . The method of  claim 50 , comprising: 
 replacing in the data structure the first symbol with the second symbol.    
   
   
       52 . The method of  claim 49 , comprising: 
 recognizing a transaction when a third symbol is placed in the data structure.    
   
   
       53 . The method of  claim 52 , comprising: 
 emptying the data structure when the transaction is recognized.

Join the waitlist — get patent alerts

Track US2006074619A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.