2018
DOI: 10.1007/978-3-030-00151-3_4
|View full text |Cite
|
Sign up to set email alerts
|

Monitoring Temporal Logic with Clock Variables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 32 publications
0
4
0
Order By: Relevance
“…The AAN fragment of TPTL was chosen due to its polynomial time complexity while still being strictly more expressive then STL. Note that further algorithmic improvements on AAN-TPTL are possible, for example, see Elgyutt et al (2018); Ghorbel and Prabhu (2022). Nevertheless, TQTL cannot reason directly about properties of bounding boxes.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The AAN fragment of TPTL was chosen due to its polynomial time complexity while still being strictly more expressive then STL. Note that further algorithmic improvements on AAN-TPTL are possible, for example, see Elgyutt et al (2018); Ghorbel and Prabhu (2022). Nevertheless, TQTL cannot reason directly about properties of bounding boxes.…”
Section: Related Workmentioning
confidence: 99%
“…Unfortunately, the time complexity of monitoring TPTL requirements is PSPACE-hard (see Markey and Raskin (2006)). Even though the syntax and semantics of STPL that we introduce in Section 4 allow arbitrary use of time variables in the formulas, in practice, in our implementation, we focus on TPTL fragments which are computable in polynomial time (see Dokhanchi et al (2016); Elgyutt et al (2018); Ghorbel and Prabhu (2022)).…”
Section: Introductionmentioning
confidence: 99%
“…Unfortunately, the time complexity of monitoring TPTL requirements is PSPACE-hard [27]. Hence, we work with TPTL fragments that are efficiently computable [28], [29].…”
Section: Introductionmentioning
confidence: 99%
“…When monitoring logics with quantifiers using standard bottom-up approach, subformulas containing free variables evaluate not to Boolean-or real-valued signals, but to maps from time to non-convex sets, and they cannot in general be efficiently manipulated (although for some classes of formulas monitoring of logics with quantifiers works well [4,13]). Perhaps the most benign in this respect but also least expressive extension is 1-TPTL (TPTL with one active clock), which is as expressive as MITL, but is easier to use and admits a reasonably efficient monitoring procedure [11].…”
Section: Introductionmentioning
confidence: 99%