Agent state drive simulation and method for detecting simulated drive fights

• US 20030004698A1
• Filed: 06/29/2001
• Published: 01/02/2003
• Est. Priority Date: 06/29/2001
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Kennedy, Thomas J., Osborn, Daniel D.
• Application Number:
  US09/896,612
• Publication Number:
  US 20030004698A1
• Time in Patent Office: Days
• US Class Current: 703/14
• CPC Class Codes: G06F 30/33 Design verification, e.g. functional simulation or model checking

Abstract

A method for detecting bus fights in a simulated bus system comprising simulating a first logic sequence and a second logic sequence respectively representing an output sequence of a first simulated device and a second simulated drive to a simulated bus, and determining a bus fight condition exists when a high logic state of the first logic sequence and the second logic sequence is detected on an adjacent clock cycle is provided. A computer executable program operable to cause a computer to simulate a respective sequence of logic states of a first device and a second device, determine the first device has gained access to the bus during a first clock cycle, analyze the logic state of the second device, and determine a bus fight condition exists when the second device has gained access to the bus during a clock cycle adjacent to the first clock cycle is provided.

Claims

1. A method for detecting bus fights in a simulated bus system, comprising:

simulating a first logic sequence representing an output sequence of a first simulated device to a simulated bus;

simulating a second logic sequence representing an output sequence of a second simulated device to the simulated bus;

determining a bus fight condition exists when a high logic state of the first logic sequence is detected on an adjacent clock cycle to a high logic state of the second logic sequence.

3. The method according to claim 1, wherein simulating a first logic sequence representing an output sequence of a first simulated device to a simulated bus further comprises simulating a logic sequence representing an output sequence of the first simulated device to the bus on an address line and simulating an output sequence of the first simulated device to the bus on a data line, and simulating a second logic sequence representing an output sequence of a second simulated device to the simulated bus further comprises simulating a logic sequence representing an output sequence of the second simulated device to the bus on an address line and simulating an output sequence of the second simulated device to the bus on a data line.

4. The method according to claim 3, wherein determining a bus fight condition exists when a high logic state of the first logic sequence is detected on an adjacent clock cycle to a high logic state of the second logic sequence further comprises determining a bus fight condition exists when a high logic state of the first simulated device on one of the address line and the data line is detected on an adjacent clock cycle of the high logic state of the second simulated device, the high logic state of the second simulated device on one of the address line and the data line.

5. The method according to claim 1, wherein simulating a first logic sequence further comprises simulating data and address signals driven by the first simulated device, the data and logic sequences including simulated drive delays.

6. The method according to claim 1, wherein simulating a first logic sequence representing an output sequence of a first simulated device to a simulated bus further comprises simulating a first logic sequence representing an output sequence of the first simulated device to the simulated bus having a simulated clock speed.

7. The method according to claim 1, further comprising simulating a bus arbitrator that enables high logic states within at least one of the first logic sequence and the second logic sequence.

8. The method according to claim 7, wherein simulating a bus arbitrator further comprises simulating an output enable transmission to the first simulated device and the second simulated device.

9. The method according to claim 1, further comprising simulating propagation delays between the first simulated device and the simulated bus and simulating propagation delays between the second simulated device and the bus.

10. The method according to claim 1, further comprising maintaining a record of a logic state of three consecutive cycles for each of the first logic sequence and the second logic sequence, the record maintained in a first-in first-out order.

2. The method according to claim 2, wherein determining a bus fight condition exists further comprises determining a bus fight condition exists when a high logic state of the first logic sequence is detected on a clock cycle having a high logic state of the second logic sequence on the same clock cycle.

11. A computer executable program, comprising:

a computer readable medium;

computer executable instructions residing on the computer readable medium and operable to cause the computer to execute the following steps;

simulating a respective sequence of logic states of a first device and a second device, each of the devices operable to drive signals to a bus;

reading the sequence of logic states by a drive state monitor module;

determining the first device has gained access to the bus during a first clock cycle;

analyzing, for the first clock cycle and a clock cycle prior to and subsequent to the first clock cycle, the logic state of the second device; and

determining a bus fight condition exists if one of the analyzed logic states of the second device indicates the second device has gained access to the bus.

12. The computer executable program according to claim 11, wherein reading a sequence of logic states further comprises reading a sequence of logic states of a simulated first line and a simulated second line that respectively model a connection between the first device and the second device to a bus arbitrator, the sequence of logic states representing a respective enable input of the first device and the second device.

13. The computer executable program according to claim 11, wherein reading a sequence of logic states further comprises reading a sequence of logic states of at least a first simulated line respectively modeling a connection between the first device and the bus and a second simulated line respectively modeling a connection between the second device and the bus, and determining the first device has gained access to the bus during a first clock cycle further comprises determining the first device simulates a signal drive to the bus during the first clock cycle.

14. The computer executable program according to claim 13, wherein reading a sequence of logic states further comprises reading a sequence of logic states of a simulated first plurality of lines respectively modeling a connection between the first device and the bus and reading a plurality of logic states of a simulated second plurality of lines respectively modeling a connection between the second device and the bus.

15. The computer executable program according to claim 13, wherein reading a sequence of logic states on a first simulated line further comprises reading a respective sequence of logic states of a simulated address line modeling a connection between the first device and the bus and a simulated data line modeling a connection between the first device and the bus, and reading a sequence of logic states on a second simulated line further comprises reading a respective sequence of logic states on a simulated address line modeling a connection between the second device and the bus and a simulated data line modeling a connection between the second device and the bus.