Patent US5691912A successfully refreshed from Google Patents.
US5691912A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for entering state flow diagrams using schematic editor programs
Assignee: Xilinx Inc
•
Filing: 1995-06-05
•
Granted: 1997-11-25
•
Expires: 2015-06-05
Abstract
Abstract A system and method for entering a circuit design into a computer using a schematic capture package. The schematic capture package is modified to include a library of state flow components represented by symbols which can be connected to produce a desired representation of the circuit design. The system allows a circuit design to be displayed on a video terminal using both state flow diagram and the schematic diagram symbols, with terminals of the state flow symbols connecting to terminals of the schematic symbols. The state flow diagram using state flow symbols is combined with a schematic diagram including schematic symbols to generate a netlist representing the combined circuit.
Inventors
- 👤 Robert G. Duncan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 16:27
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
139 words
A computer readable medium storing an executable schematic capture program, the program having sequences of instructions which, when executed by a processor, cause the processor to perform the following steps: forming a state flow diagram on a computer video terminal in response to a user selecting state flow components from a library and connecting the state flow components by flow bus segments, each state flow component in the library including a state flow symbol and an underlying circuit design, the library comprising at least one spawn state flow component connectable to at least two other state flow components, wherein states represented by each of the other state flow components are independent and simultaneously active; and generating a netlist from netlists for underlying circuit designs of each of the state flow symbols and connections indicated by the flow bus segments.
Claim 2
Dependent Claim
139 words
A computer readable medium storing an executable schematic capture program, the program having sequences of instructions which, when executed by a processor, cause the processor to perform the following steps: forming a state flow diagram on a computer video terminal in response to a user selecting state flow components from a library and connecting the state flow components by flow bus segments, each state flow component in the library including a state flow symbol and an underlying circuit design, the library comprising at least one spawn state flow component connectable to at least two other state flow components, wherein states represented by each of the other state flow components are independent and simultaneously active; and generating a netlist from netlists for underlying circuit designs of each of the state flow symbols and connections indicated by the flow bus segments.
Claim 3
Dependent Claim
99 words
The computer readable medium of claim 1, wherein the sequences of instructions further cause the processor to perform the step of forming a circuit diagram on the video terminal in response to the user selecting schematic components from a library and connecting the schematic components by signal lines, each schematic component including an underlying circuit design and a schematic symbol, and wherein the netlist is further generated from netlists for underlying circuit designs of each of the schematic symbols, the netlist including at least one connection between one of the state flow components and one of the schematic components.
Claim 4
Dependent Claim
21 words
The computer readable medium of claim 2, wherein the schematic components and state flow components are part of the same library.
Claim 5
Dependent Claim
142 words
An integrated circuit produced by: forming on a computer video terminal a state flow diagram representative of a state machine in response to a user selecting state flow components from a library and connecting the state flow components by flow bus segments, each state flow component in the library including a state flow symbol and an underlying circuit design, the library comprising at least one spawn state flow component connectable to at least two other state flow components wherein states represented by each of the other state flow components are independent and simultaneously active; generating a netlist incorporating underlying circuit designs of each of the state flow symbols as connected by the flow bus segments; and configuring an integrated circuit device using the netlist so as to implement the state machine, whereby the state machine transitions through independent sequences of states simultaneously.
Claim 6
Dependent Claim
142 words
An integrated circuit produced by: forming on a computer video terminal a state flow diagram representative of a state machine in response to a user selecting state flow components from a library and connecting the state flow components by flow bus segments, each state flow component in the library including a state flow symbol and an underlying circuit design, the library comprising at least one spawn state flow component connectable to at least two other state flow components wherein states represented by each of the other state flow components are independent and simultaneously active; generating a netlist incorporating underlying circuit designs of each of the state flow symbols as connected by the flow bus segments; and configuring an integrated circuit device using the netlist so as to implement the state machine, whereby the state machine transitions through independent sequences of states simultaneously.
Claim 7
Dependent Claim
137 words
In a computer system having a memory device, a computer implemented process for generating a netlist for a circuit design for a state machine having multiple active states, the process comprising the steps of: receiving and storing on the memory device a first portion of the circuit design comprising a plurality of state flow components connected by flow bus segments, each state flow component including a state flow symbol and an underlying circuit design, the plurality of state flow components comprising at least one spawn state flow component connectable to at least two other state flow components wherein states represented by each of the other state flow components are independent and simultaneously active; and generating a netlist including netlists for underlying circuit designs of each of the state flow symbols as connected by the flow bus segments.
Claim 8
Dependent Claim
137 words
In a computer system having a memory device, a computer implemented process for generating a netlist for a circuit design for a state machine having multiple active states, the process comprising the steps of: receiving and storing on the memory device a first portion of the circuit design comprising a plurality of state flow components connected by flow bus segments, each state flow component including a state flow symbol and an underlying circuit design, the plurality of state flow components comprising at least one spawn state flow component connectable to at least two other state flow components wherein states represented by each of the other state flow components are independent and simultaneously active; and generating a netlist including netlists for underlying circuit designs of each of the state flow symbols as connected by the flow bus segments.
Claim 9
Dependent Claim
78 words
The process of claim 5, further comprising the step of receiving and storing on the memory device a second portion of the circuit design comprising a plurality of schematic components, each schematic component including an underlying circuit design and a schematic symbol, and wherein the netlist comprises netlists for underlying circuit designs of each of the schematic symbols, the netlist including at least one connection between one of the state flow components and one of the schematic components.
References Cited (Backward Citations)
GB1445914A
Cited
US4827427A
Cited
US4922432A
Cited
US5197016A
Cited
US5301318A
Cited
US4970664A
Cited
US4967367A
Cited
US5051938A
Cited
US5164911A
Cited
US5210699A
Cited
US5084824A
Cited
US5222030A
Cited
US5220512A
Cited
US5258919A
Cited
US5278769A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-11-24 | 2001-05-26 | 2001-11-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-11-24 | 2005-05-26 | 2005-11-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-11-24 | 2009-05-26 | 2009-11-25 | $7700.00 | Window Closed / Lapsed |