Adequate Sets of Temporal Connectives in CTL

Martin, Alan J.

doi:10.1016/s1571-0661(04)00214-2

Cited by 5 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, there is redundancy between the connectives in CTL formulas in Appendix S1 , and we can reduce the number of categories of verification algorithms by analyzing the equivalence relations with each other. As in [32] , an adequate set of CTL is a subset of temporal connectives in CTL that is sufficient to express the equivalent formulas in CTL. An adequate set of temporal connectives in CTL contains at least one of {AX, EX} and one of {EG, AF, AU}, as well as EU.…”

Section: Methodsmentioning

confidence: 99%

A Formal Algorithm for Verifying the Validity of Clustering Results Based on Model Checking

et al. 2014

View full text Add to dashboard Cite

The limitations in general methods to evaluate clustering will remain difficult to overcome if verifying the clustering validity continues to be based on clustering results and evaluation index values. This study focuses on a clustering process to analyze crisp clustering validity. First, we define the properties that must be satisfied by valid clustering processes and model clustering processes based on program graphs and transition systems. We then recast the analysis of clustering validity as the problem of verifying whether the model of clustering processes satisfies the specified properties with model checking. That is, we try to build a bridge between clustering and model checking. Experiments on several datasets indicate the effectiveness and suitability of our algorithms. Compared with traditional evaluation indices, our formal method can not only indicate whether the clustering results are valid but, in the case the results are invalid, can also detect the objects that have led to the invalidity.

show abstract

Section: Methodsmentioning

confidence: 99%