2019 IEEE 58th Conference on Decision and Control (CDC) 2019
DOI: 10.1109/cdc40024.2019.9029181
|View full text |Cite
|
Sign up to set email alerts
|

Graph Temporal Logic Inference for Classification and Identification

Abstract: Inferring spatial-temporal properties from data is important for many complex systems, such as additive manufacturing systems, swarm robotic systems and biological networks. Such systems can often be modeled as a labeled graph where labels on the nodes and edges represent relevant measurements such as temperatures and distances. We introduce graph temporal logic (GTL) which can express properties such as "whenever a node's label is above 10, for the next 3 time units there are always at least two neighboring n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
2

Relationship

2
6

Authors

Journals

citations
Cited by 26 publications
(23 citation statements)
references
References 23 publications
0
23
0
Order By: Relevance
“…The inference problem of temporal logic, in general, has gained popularity in the recent years. Apart from LTL, this problem has been looked at for a variety of logics, including Past Time Linear Temporal Logic (PLTL) [1], Signal Temporal Logic (STL) [19,10,20,12,2,9], Property Specification Language (PSL) [17] and several others [21,22,24].…”
Section: Related Workmentioning
confidence: 99%
“…The inference problem of temporal logic, in general, has gained popularity in the recent years. Apart from LTL, this problem has been looked at for a variety of logics, including Past Time Linear Temporal Logic (PLTL) [1], Signal Temporal Logic (STL) [19,10,20,12,2,9], Property Specification Language (PSL) [17] and several others [21,22,24].…”
Section: Related Workmentioning
confidence: 99%
“…Definition 2.8 (Graph-temporal trajectory). [35] A graph-temporal trajectory on a graph G is a tuple д = (s, y), where s : T → S assigns a node label for each node i ∈ V at each time index t ∈ T, and y : T → Y assigns a edge label for each edge e i ∈ E at each time index t ∈ T. The first item in the labels is for time index 1, and the second item in the labels is for time index 2. Definition 2.9 (Node and edge propositions).…”
Section: Graph Temporal Logicmentioning
confidence: 99%
“…Our first contribution is to represent spatial-temporal tasks in a specification language called graph temporal logic (GTL) [35]. GTL formulas represent tasks such as "the police officer at node 3 or their neighboring officers should visit intersection labeled as blue in every two hours".…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Similarly, a method for learning signal classifiers from data was presented in [52], by means of incrementally learning an STL formulae. Other algorithms were introduced to infer GTL formulas from data in [123], which were used for classification and identification.…”
Section: B Classificationmentioning
confidence: 99%