Symbolic Model Checking for Three Valued Logic
Jian Guo, Jungang Han
Abstract
Jian Guo, Jungang Han
Abstract
Classical model checking can not be used to reason about system with uncertainty. We extend model checking in order to verify properties of a 3-valued system. A triple decision diagram (TDD) and its operations are given. Then states, transitional relations and label function of a system with a partial Kripke structure are implemented by TDDs. The algorithm of 3 valued symbolic model checking is presented. Finally potential applications in hardware and SoC are discussed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Classical model checking can not be used to reason about system with uncertainty. We extend model checking in order to verify properties of a 3-valued system. A triple decision diagram (TDD) and its operations are given. Then states, transitional relations and label function of a system with a partial Kripke structure are implemented by TDDs. The algorithm of 3 valued symbolic model checking is presented. Finally potential applications in hardware and SoC are discussed.
Key concepts: Model checking, Symbolic trajectory evaluation, Computer science, Kripke structure, Abstraction model checking, Theoretical computer science, Algorithm, Computation tree logic