PSL is a kind of temporal logic which uses SEREs as additional formula constructs. We present a variant of PSL, namely APSL, which replaces SEREs with finite automata. APSL and PSL are of the exactly same expressiveness. In this paper, we extend the LTL symbolic model checking algorithm??to that of APSL, and present a tableau based APSL verification approach. Moreover, we show how to implement this algorithm via the BDD based symbolic approach.
Index Terms:
PSL, Symbolic model checking
Citation:
Wanwei Liu, Ji Wang, Huowang Chen, Xiaodong Ma, "Symbolic Model Checking APSL," tase, pp.39-46, 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, 2008