• Corpus ID: 18082600

VHDL Based Symbolic Model Checker with Improved CTL Property Language

  title={VHDL Based Symbolic Model Checker with Improved CTL Property Language},
  author={Hamid Shojai and Hadi Parandeh Afshar and Zainalabedin Navabi},
The multistage tandem wire drawing apparatus according to the present invention has a heating mechanism and wire drawing units (draw benches) arranged in tandem to correspond to the respective manufacturing stages of the work, and is characterized in that a tension of the work moving between the wire drawing units is measured. The measured tension and a predetermined reference tension are compared to calculate any deviation therebetween, and, by using a movable chuck speed of a predetermined… 


VIS: A System for Verification and Synthesis
VIS provides the capability to check the combinational equivalence of two designs and provides traditional verification in the form of a cycle-based simulator that uses BDD techniques.
Iterative abstraction-based CTL model checking
A paradigm for automatic approximation/refinement in conservative CTL model checking is presented, and a new type of don't cares that can make model checking more efficient in time and space is presented.
Using integer equations for high level formal verification property checking
  • B. AlizadehM. R. Kakoee
  • Computer Science
    Fourth International Symposium on Quality Electronic Design, 2003. Proceedings.
  • 2003
The use of integer equations for high level modeling digital circuits for application of formal verification properties at this level is described and the results are compared with those of the VIS verification tool that is a BDD based program.
Multi-valued symbolic model-checking
The model-checker works for any member of a large class of multi-valued logics and is based on a generalization of Kripke structures, where both atomic propositions and transitions between states may take any of the truth values of a givenmulti-valued logic.
Modular Partitioning and Dynamic Conjunction Scheduling in Image Computation
This paper describes an approach to build a hierarchical modular partitioned transition relation and presents a dynamic conjunction scheduling a lgorithm that improves the flexibility and computational flexibility of the image computation.
Intermediate Format Standardization : Ambiguities , Deficiencies , Portability issues , Documentation and Improvements
This paper focuses on the AIRE weaknesses and presents the solutions according to the experiences with theAIRE implementation, as well as discussing some of the proposed solutions to address these shortcomings.
An Introduction to Binary Decision Diagrams
The major diierences are as follows: Firstly, ROBDDs are now viewed as nodes of one global graph with one xed ordering to reeect state-of-the-art of eecient BDD packages.
Model-Checking over Multi-valued Logics
The use of quasi-boolean multi-valued logics for reasoning about systems with uncertainty or inconsistency is proposed and semantics to a multi- valued extension of CTL is given.
Hierarchical image computation with dynamic conjunction scheduling
  • C. MeinelC. Stangier
  • Computer Science
    Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001
  • 2001
Algorithms for building a hierarchically partitioned transition relation and conjunction scheduling based on this partitioning are presented and targeted to improve the AndExist operation.
To split or to conjoin: the question in image computation
Experimental results show that the hybrid algorithm is much more robust than the “pure” algorithms and outperforms both of them in most cases and shed light on the remark of several researchers that splitting is especially effective in approximate reachability analysis.