Open Access
2014 Terminal Satisfiability in GSTE
Yongsheng Xu, Guowu Yang, Zhengwei Chang, Desheng Zheng, Wensheng Guo
J. Appl. Math. 2014(SI11): 1-10 (2014). DOI: 10.1155/2014/725275


Generalized symbolic trajectory evaluation (GSTE) is an extension of symbolic trajectory evaluation (STE) and a method of model checking. GSTE specifications are given as assertion graphs. There are four efficient methods to verify whether a circuit model obeys an assertion graph in GSTE, Model Checking Strong Satisfiability (SMC), Model Checking Normal Satisfiability (NMC), Model Checking Fair Satisfiability (FMC), and Model Checking Terminal Satisfiability (TMC). SMC, NMC, and FMC have been proved and applied in industry, but TMC has not. This paper gives a six-tuple definition and presents a new algorithm for TMC. Based on these, we prove that our algorithm is sound and complete. It solves the SMC’s limitation (resulting in false negative) without extending from finite specification to infinite specification. At last, a case of using TMC to verify a realistic hardware circuit round-robin arbiter is achieved. Avoiding verifying the undesired paths which are not related to the specifications, TMC makes it possible to reduce the computational complexity, and the experimental results suggest that the time cost by SMC is 3.14× with TMC in the case.


Download Citation

Yongsheng Xu. Guowu Yang. Zhengwei Chang. Desheng Zheng. Wensheng Guo. "Terminal Satisfiability in GSTE." J. Appl. Math. 2014 (SI11) 1 - 10, 2014.


Published: 2014
First available in Project Euclid: 1 October 2014

zbMATH: 07131823
Digital Object Identifier: 10.1155/2014/725275

Rights: Copyright © 2014 Hindawi

Vol.2014 • No. SI11 • 2014
Back to Top