2019
DOI: 10.1007/978-3-030-11638-5_5
|View full text |Cite
|
Sign up to set email alerts
|

A Linear Temporal Logic Model Checking Method over Finite Words with Correlated Transition Attributes

Abstract: Temporal logic model checking techniques are applied, in a natural way, to the analysis of the set of finite traces composing a system log. The specific nature of such traces helps in adapting traditional techniques in order to extend their analysis capabilities. The paper presents an adaption of the classical Timed Propositional Temporal Logic to the case of finite words and considers relations among different attributes corresponding to different events. The introduced approach allows the use of general rela… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 25 publications
(28 reference statements)
0
2
0
Order By: Relevance
“…The complete data (features along with the initial properties) from the clustering process was used to validate the clusters using model checking techniques [63]. To this end, this study proposes a set of validation queries related to results obtained from the clustering process.…”
Section: B Cluster Validationmentioning
confidence: 99%
See 1 more Smart Citation
“…The complete data (features along with the initial properties) from the clustering process was used to validate the clusters using model checking techniques [63]. To this end, this study proposes a set of validation queries related to results obtained from the clustering process.…”
Section: B Cluster Validationmentioning
confidence: 99%
“…Q 17 : How many sessions contain three or more PURCHASE events?) Table 5 shows the results obtained for each cluster (c i ), reflecting the percentage of sessions that the validation query (Q j ) fulfills with respect to the total number of sessions of the cluster, as well as the queries described in the LTL version proposed in [63]. In the table, operators G,F, and X have the usual LTL interpretation: Always, Eventually and Next, respectively, being H,O, and Y in past counterparts.…”
Section: B Cluster Validationmentioning
confidence: 99%