Efficient production of disjoint multiple traces

Details Efficient production of disjoint multiple traces Efficient production of disjoint multiple traces

2006-12-05

2006-12-05

Rodriguez, Paul L. (Department: 2123)

Data processing: structural design, modeling, simulation, and em

Simulating electronic device or electrical system

Circuit simulation

C703S002000, C716S030000, C714S025000

Reexamination Certificate

active

07146301

ABSTRACT:
A method for checking a model, which defines states of a system under study and a transition relation among the states. The method includes specifying a property that applies to a target set that comprises at least one target state among the states of the system under study. Beginning from an initial set of at least one initial state among the states of the system, successive reachable sets are computed, including the states of the system that are reachable from the initial set, until an intersection is found between one of the reachable sets and the target set. A plurality of mutually-disjoint traces are then computed from the at least one target state in the intersection through the states in the reachable sets to the at least one initial state.

REFERENCES:
Torrieri, D.; “Algorithms for finding an optimal set of short disjoint paths in a communication network”, IEEE Transactions on Communications, vol. 40, Issue 11, Nov. 1992.
E. Clarke, Jr. et al; “Model Checking”; Chapter 1, MIT Press, 1999, pp. 4-6.
K. McMillan; “Symbolic Model Checking”, Kluwer Academic Publishers, Chapter 2, pp. 11-12; 1993.
E. M. Clarke et al; “Efficient Generation of Counterexamples and Witnesses in Symbolic Model Checking”; 32ndDesign Automation Conference, 1995, pp. 427-432.
Beer et al; “RuleBase: an Industry-Oriented Formal Verification Tool”; Proceedings of the Design Automation Conference DAC '96; 1996.
Beer et al; “On-the-fly Model Checking of RCTL Formulas”; Proceedings of the Tenth International Conference on Computer Aided Verification (CAV 1998).
Beer et al; “The Temporal Logic Sugar”; Proceedings of the Thirteenth International Conference on Computer Aided Verification (CAV 2001).
Bryant; “Graph-based Algorithms for Boolean Function Manipulation”, IEEE Transactions on Computers C-35:8 (1986).

Affiliated with

Also associated with

Rating

Efficient production of disjoint multiple traces does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient production of disjoint multiple traces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient production of disjoint multiple traces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3664465