US5706473A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer model of a finite state machine having inputs, outputs, delayed inputs and delayed outputs
Assignee: Synopsys Inc
•
Filing: 1995-03-31
•
Granted: 1998-01-06
•
Expires: 2015-03-31
Abstract
Abstract A computer system having a computer model of a Finite State Machine (FSM). The computer system includes a processor coupled to receive and manipulate the computer model, and a memory. The memory includes a computer model. The computer model includes, a first set of inputs, a first set of delayed inputs, a first set of outputs and a first set of delayed outputs. The computer model has a first output of the first set of outputs corresponding to a first input of the first set of inputs, a first delayed input of the first set of inputs and a first delayed output of the first set of delayed outputs.
Inventors
- 👤 Tonny Kai Tong Yu
- 👤 Shir-Shen Chang
- 👤 Janet Lynn O'Neil
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 10:46
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/32; G06F30/33; G06F30/3308
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
143 words
A computer system having a computer model of a Finite State Machine (FSM), said computer system comprising: a processor coupled to receive and manipulate said computer model; and a memory including said computer model, said computer model having been compiled by a compiler from a textual description of the computer model, said computer model including, a first set of inputs and a first set of delayed inputs, and a first set of outputs and a first set of delayed outputs, wherein said computer model having a first output of said first set of outputs corresponding to a first input of said first set of inputs, a first delayed input of said first set of inputs and a first delayed output of said first set of delayed outputs, said first output being provided in response to a simulation program executing on said computer system.
Claim 2
Dependent Claim
143 words
A computer system having a computer model of a Finite State Machine (FSM), said computer system comprising: a processor coupled to receive and manipulate said computer model; and a memory including said computer model, said computer model having been compiled by a compiler from a textual description of the computer model, said computer model including, a first set of inputs and a first set of delayed inputs, and a first set of outputs and a first set of delayed outputs, wherein said computer model having a first output of said first set of outputs corresponding to a first input of said first set of inputs, a first delayed input of said first set of inputs and a first delayed output of said first set of delayed outputs, said first output being provided in response to a simulation program executing on said computer system.
Claim 3
Dependent Claim
35 words
The computer system of claim 1 wherein said first set of outputs includes values from a first set of values including {Zero, One, X, N }, where X indicates UNKNOWN and N indicates NOT ACTIVE.
Claim 4
Dependent Claim
23 words
The computer system of claim 1 wherein said first set of inputs includes values from a second set of values including {Zero, One}.
Claim 5
Dependent Claim
18 words
The computer system of claim 3 wherein said second set of values includes {X}, where X indicates UNKNOWN.
Claim 6
Dependent Claim
30 words
The computer system of claim 1 wherein a state of said FSM is defined by said first input, said first delayed input, said first output, and said first delayed output.
Claim 7
Dependent Claim
75 words
The computer system of claim 5 wherein said state is defined by a state vector and wherein said memory includes said state vector, and wherein said state vector is stored as a row in a table in said memory, said table storing a plurality of relationships between states of said FSM and said first set of inputs, said first set of delayed inputs, said first set of outputs and said first set of delayed outputs.
Claim 8
Independent Claim
141 words
A method of simulating a circuit on a computer system, said circuit including a computer model of a Finite State Machine (FSM), said computer system including a processor and a memory, said processor being coupled to said memory, said method comprising: accessing a textual description of said computer model: compiling said textual description of said computer model into a compiled computer model: storing said compiled computer model in said memory; accessing said compiled computer model; accessing a first input value; accessing a first delayed input value; accessing a first delayed output value; and executing a simulation program on said processor causing said processor to access a first output value from said computer model using said first input value, said first delayed input value and said first delayed output value, said first output value corresponding to an output value of said circuit.
Claim 9
Independent Claim
141 words
A method of simulating a circuit on a computer system, said circuit including a computer model of a Finite State Machine (FSM), said computer system including a processor and a memory, said processor being coupled to said memory, said method comprising: accessing a textual description of said computer model: compiling said textual description of said computer model into a compiled computer model: storing said compiled computer model in said memory; accessing said compiled computer model; accessing a first input value; accessing a first delayed input value; accessing a first delayed output value; and executing a simulation program on said processor causing said processor to access a first output value from said computer model using said first input value, said first delayed input value and said first delayed output value, said first output value corresponding to an output value of said circuit.
Claim 10
Dependent Claim
41 words
The method of claim 7 wherein said accessing said first input value includes the step of: accessing said first input value from said memory, said first input value being in the set of values {Zero, One, X}, where X indicates UNKNOWN.
Claim 11
Dependent Claim
44 words
The method of claim 7 wherein said accessing said first delayed input value includes the step of: accessing said first delayed input value from said memory, said first delayed input value being in the set of values {Zero, One, X}, where X indicates UNKNOWN.
Claim 12
Dependent Claim
44 words
The method of claim 7 wherein said accessing said first delayed output value includes the step of: accessing said first delayed output value from said memory, said first delayed output value being in a set of values {Zero, One, X}, where X indicates UNKNOWN.
Claim 13
Dependent Claim
72 words
The method of claim 7 wherein said causing said processor to access said first output value from said computer model includes: determining an entry in a table in said memory, said table corresponding to said computer model, said determining said entry including a combination of said first input value, said first delayed input value, and said first delayed output value; and accessing said first output value from said table at said entry.
Claim 14
Dependent Claim
29 words
The method of claim 11 wherein said determining an entry in said table in said memory includes determining a state in a Finite State Machine corresponding to said circuit.
Claim 15
Independent Claim
226 words
A method of synthesizing a portion of a circuit from a computer model of a Finite State Machine (FSM) in a computer system, said computer system including a memory and a processor, said memory being coupled to said processor, said memory storing said computer model, said computer implemented method comprising: accessing a first set of outputs from said computer model; accessing a first set of delayed outputs from said computer model; accessing a first set of inputs from said computer model; accessing a first set of delayed inputs from said computer model; determining a plurality of signal types corresponding to said first set of delayed outputs, said first set of inputs, and said first set of delayed inputs, said determining said plurality of signal types including. identifying a first set of synchronous data signal types. identifying a first set of asynchronous data signal types. identifying a first set of asynchronous reset signal types. identifying a first set of asynchronous set signal _types, identifying a first set of asynchronous enable signal types, identifying a plurality of active levels, identifying a plurality of unatenesses, identifying a plurality of edge sensitive signal types, and identifying a plurality of level sensitive signal types; and determining a first circuit primitive corresponding to an output of said first set of outputs and a first signal type of said plurality of signal types.
Claim 16
Independent Claim
226 words
A method of synthesizing a portion of a circuit from a computer model of a Finite State Machine (FSM) in a computer system, said computer system including a memory and a processor, said memory being coupled to said processor, said memory storing said computer model, said computer implemented method comprising: accessing a first set of outputs from said computer model; accessing a first set of delayed outputs from said computer model; accessing a first set of inputs from said computer model; accessing a first set of delayed inputs from said computer model; determining a plurality of signal types corresponding to said first set of delayed outputs, said first set of inputs, and said first set of delayed inputs, said determining said plurality of signal types including. identifying a first set of synchronous data signal types. identifying a first set of asynchronous data signal types. identifying a first set of asynchronous reset signal types. identifying a first set of asynchronous set signal _types, identifying a first set of asynchronous enable signal types, identifying a plurality of active levels, identifying a plurality of unatenesses, identifying a plurality of edge sensitive signal types, and identifying a plurality of level sensitive signal types; and determining a first circuit primitive corresponding to an output of said first set of outputs and a first signal type of said plurality of signal types.
Claim 17
Dependent Claim
60 words
The method of claim 13 wherein said accessing said first set of outputs from said computer model further includes: executing a synthesis program; accessing said computer model in response to said synthesis program, said computer model being represented as a table in said memory; and accessing a column of said table, said column corresponding to said first set of outputs.
Claim 18
Dependent Claim
29 words
The method of claim 13 wherein said determining said plurality of signal types includes: identifying a subset of said first set of inputs as being a clock signal type.
Claim 19
Dependent Claim
29 words
The method of claim 13 wherein said determining said plurality of signal types includes: identifying a subset of said first set of inputs as being a preset signal type.
References Cited (Backward Citations)
US4740891A
Cited
US4799141A
Cited
US4862347A
Cited
US5313615A
Cited
US5253363A
Cited
US5051938A
Cited
US5163016A
Cited
US5371878A
Cited
US5414812A
Cited
US5389838A
Cited
US5485600A
Cited
US5325528A
Cited
US5325533A
Cited
US5539680A
Cited
US5542034A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-01-05 | 2001-07-07 | 2002-01-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-01-05 | 2005-07-07 | 2006-01-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-01-05 | 2009-07-07 | 2010-01-06 | $7700.00 | Window Closed / Lapsed |