Skip to main content

3 Result(s)

within Conghua Zhou Remove this filter Computer Science Remove this filter Computation by Abstract Devices Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Improved SAT Based Bounded Model Checking

    The usefulness of Bounded Model Checking(BMC) based on propositional satisfiability methods has recently proven its efficacy for bug hunting. The basic idea is to search for a counterexample in executions whos...

    Conghua Zhou, Decheng Ding in Theory and Applications of Models of Computation (2006)

  2. No Access

    Chapter and Conference Paper

    QBF-Based Symbolic Model Checking for Knowledge and Time

    For temporal and epistemic property CTLK we propose a new symbolic model checking technique based on Quantified Boolean Formula(QBF). The verification approach is based on an adaption of the technique of bound...

    Conghua Zhou, Zhenyu Chen, Zhihong Tao in Theory and Applications of Models of Computation (2007)

  3. No Access

    Chapter and Conference Paper

    Abstraction for Model Checking the Probabilistic Temporal Logic of Knowledge

    Probabilistic temporal logics of knowledge have been used to specify multi-agent systems. In this paper, we introduce a probabilistic temporal logic of knowledge called PTLK for expressing time, knowledge, and...

    Conghua Zhou, Bo Sun, Zhifeng Liu in Artificial Intelligence and Computational Intelligence (2010)