Automata-theoretic verification of systems
AssigneeLucent Technologies Inc.
InventorsRonald H. Hardin, Robert Paul Kurshan
Life of this patent
Estimating the term…
Loading patent…
AssigneeLucent Technologies Inc.
InventorsRonald H. Hardin, Robert Paul Kurshan
Estimating the term…
Verification systems which employ automata-theoretic formal verification use a model automaton made from a system process (203) representing the system and a task automaton (205) representing the task and use the model automaton to test (217) whether the language of the system process is contained in the language of the task automaton. An improved technique reduces the computational complexity of the language containment testing by producing a model (216) which represents a system which has been automatically localized with regard to a task. Another technique reduces the computational complexity of stepwise refinement (208). In stepwise refinement, the system automaton is refined a step at a time until it reaches the complexity of a practical implementation. The computational complexity of the stepwise refinement is reduced by a technique which permits language containment to be tested using a set of models made from process-automaton pairs rather than process-process pairs.
Improved design testing apparatus for making a determination whether a design performs a task, the design testing apparatus being of the type which includes means for making the determination by testing a model automaton including variables and the improvement comprising:
Improved design testing apparatus for making a determination whether a design performs a task, the design testing apparatus being of the type which includes means for making the determination by testing a model automaton including variables and the improvement comprising:
A method for testing a design to determine whether the design defines a task, the method comprising:
A method for testing a design to determine whether the design defines a task, the method comprising:
A method used in design verification apparatus for verifying that a first process is a valid refinement of a second process, the design verifications apparatus being of the type which tests whether a process's language is contained in an automaton's language, there being a language homomorphism between the language of the first process and the language of the second process and the method comprising the steps performed in the design verification apparatus of:
A design testing apparatus for determining whether a design performs a task, the design testing apparatus including means for testing a model automaton having variables, the apparatus comprising:
Improved design testing apparatus for making a determination whether a design performs a task, the design testing apparatus being of the type which includes means for making the determination by testing a model including variables and the improvement comprising:
Improved design testing apparatus for making a determination whether a design performs a task, the design testing apparatus being of the type which includes means for making the determination by testing a model including variables and the improvement comprising:
A method for testing a model of a design to determine whether the design defines a task, the model being of the type that includes variables, the method comprising:
A method for testing a model of a design to determine whether the design defines a task, the model being of the type that includes variables, the method comprising:
Dependencies are inferred from the claim text.