Abstract
Temporal logic model checking is a method for automatically deciding if a sequential circuit satisfies its specifications. In this approach, the circuit is modelled as a state transition system, and specifications are given by temporal logic formulas. Efficient search algorithms are used to determine if the specifications are satisfied or not. The procedure has been used successfully in the past to find subtle errors in a number of non trivial circuit designs. Recently, the size of the circuits that can be handled by this technique has increased dramatically. It is now possible to verify transition systems that are many orders of magnitude larger than was previously the case. In this paper, we describe some of the techniques that have made this increase possible. These techniques are based on the use of
binary decision diagrams
to represent transition systems and sets of states.
Subject
Pharmacology (medical),Complementary and alternative medicine,Pharmaceutical Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Model Checking;Handbook of Automated Reasoning;2001
2. Synthesis of concurrent systems with many similar processes;ACM Transactions on Programming Languages and Systems;1998-01
3. Siemens Industrial Experience;Practical Formal Methods for Hardware Design;1997
4. Equivalences for fair Kripke structures;Automata, Languages and Programming;1994
5. Formula-Dependent Abstraction for CTL Model Checking;Computational Science and Its Applications – ICCSA 2008