Open Access
Translator Disclaimer
2013 A Transformation-Based Approach to Implication of GSTE Assertion Graphs
Guowu Yang, William N. N. Hung, Xiaoyu Song, Wensheng Guo
J. Appl. Math. 2013(SI10): 1-7 (2013). DOI: 10.1155/2013/709071

Abstract

Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to the model checking of ω -regular properties. It is an alternative to classical model checking algorithms where properties are specified as finite-state automata. In GSTE, properties are specified as assertion graphs, which are labeled directed graphs where each edge is labeled with two labeling functions: antecedent and consequent. In this paper, we show the complement relation between GSTE assertion graphs and finite-state automata with the expressiveness of regular languages and ω -regular languages. We present an algorithm that transforms a GSTE assertion graph to a finite-state automaton and vice versa. By applying this algorithm, we transform the problem of GSTE assertion graphs implication to the problem of automata language containment. We demonstrate our approach with its application to verification of an FIFO circuit.

Citation

Download Citation

Guowu Yang. William N. N. Hung. Xiaoyu Song. Wensheng Guo. "A Transformation-Based Approach to Implication of GSTE Assertion Graphs." J. Appl. Math. 2013 (SI10) 1 - 7, 2013. https://doi.org/10.1155/2013/709071

Information

Published: 2013
First available in Project Euclid: 9 May 2014

zbMATH: 1311.68091
MathSciNet: MR3074329
Digital Object Identifier: 10.1155/2013/709071

Rights: Copyright © 2013 Hindawi

JOURNAL ARTICLE
7 PAGES


SHARE
Vol.2013 • No. SI10 • 2013
Back to Top