Skip to main content

2018 | OriginalPaper | Buchkapitel

Monitoring Temporal Logic with Clock Variables

verfasst von : Adrián Elgyütt, Thomas Ferrère, Thomas A. Henzinger

Erschienen in: Formal Modeling and Analysis of Timed Systems

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
While temporal logic monitoring provides less guarantees than other formal methods such as model checking, the range of applicability of monitoring techniques is wider as it does not suffer from the infamous state-explosion: for monitoring purposes, all that is needed from the system model is its ability to generate execution traces.
 
2
The original presentation of TPTL instead talks of freeze quantifiers that store the absolute time in variables xy later compared using difference constraints \(y-x \le c\). We found it more convenient to work with clocks and associated reset quantifiers as in [31], although both presentations are equivalent.
 
3
This does not follow straightforwardly from [1], since TPTL does not translate to timed automata: its satisfiability over dense time is undecidable [3].
 
4
The Minkowski difference \(T_i \ominus I\) is by definition \(\{t - s \in \mathbb {T}~:~t \in T_i \text { and } s \in I \}\).
 
5
The fixed point \(\cup \mathcal Y_{n+1} \subseteq \bigcup _{i=0}^{n} \mathcal Y_i\) exists because only finitely many difference constraints over \(\mathbb {T}\) can be built from \(\mathcal {Z}_\varphi \) and \(\mathcal {Z}_\psi \).
 
6
Similar formulas with independent variables were considered in [15] in the context of monitoring. We remark that the fragment of TPTL defined there corresponds to 1-TPTL when clocks are renamed.
 
7
A more general definition of region equivalence could be used. Our restriction of this notion to quantifier-free formulas is motivated by efficiency concerns. For instance, we aim to avoid partitioning the satisfaction set of formula \(x.{\lozenge }(x \le 1 \wedge p \wedge x. {\lozenge }(x \le 2 \wedge q))\) according to timing constant \(1+2\) for all subformulas. While the constant is relevant in subformula \({\lozenge }(x \le 1 \wedge p \wedge x. {\lozenge }(x \le 2 \wedge q))\), it plays no role in \({\lozenge }(x \le 2 \wedge q)\).
 
8
Formula \(\varphi _4\) could also be put in MTL form using some additional rewriting, but is not part of the MTL syntactic fragment of TPTL we defined.
 
Literatur
7.
Zurück zum Zitat Basin, D., Klaedtke, F., Müller, S., Zălinescu, E.: Monitoring metric first-order temporal properties. J. ACM (JACM) 62(2), 15 (2015)MathSciNetCrossRef Basin, D., Klaedtke, F., Müller, S., Zălinescu, E.: Monitoring metric first-order temporal properties. J. ACM (JACM) 62(2), 15 (2015)MathSciNetCrossRef
10.
Zurück zum Zitat Bozga, M., Fernandez, J.-C., Ghirvu, L., Graf, S., Krimm, J.-P., Mounier, L.: IF: a validation environment for timed asynchronous systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 543–547. Springer, Heidelberg (2000). https://doi.org/10.1007/10722167_41CrossRef Bozga, M., Fernandez, J.-C., Ghirvu, L., Graf, S., Krimm, J.-P., Mounier, L.: IF: a validation environment for timed asynchronous systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 543–547. Springer, Heidelberg (2000). https://​doi.​org/​10.​1007/​10722167_​41CrossRef
11.
Zurück zum Zitat Brim, L., Dluhoš, P., Šafránek, D., Vejpustek, T.: STL*: extending signal temporal logic with signal-value freezing operator. Inf. Comput. 236, 52–67 (2014)MathSciNetCrossRef Brim, L., Dluhoš, P., Šafránek, D., Vejpustek, T.: STL*: extending signal temporal logic with signal-value freezing operator. Inf. Comput. 236, 52–67 (2014)MathSciNetCrossRef
12.
Zurück zum Zitat Chai, M., Schlingloff, H.: A rewriting based monitoring algorithm for TPTL. In: International Workshop on Concurrency, Specification and Programming (CS&P), pp. 61–72 (2013) Chai, M., Schlingloff, H.: A rewriting based monitoring algorithm for TPTL. In: International Workshop on Concurrency, Specification and Programming (CS&P), pp. 61–72 (2013)
13.
Zurück zum Zitat Clavel, M.: Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285(2), 187–243 (2002)MathSciNetCrossRef Clavel, M.: Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285(2), 187–243 (2002)MathSciNetCrossRef
15.
Zurück zum Zitat Dokhanchi, A., Hoxha, B., Tuncali, C.E., Fainekos, G.: An efficient algorithm for monitoring practical TPTL specifications. In: International Conference on Formal Methods and Models for System Design (MEMOCODE), pp. 184–193. IEEE (2016) Dokhanchi, A., Hoxha, B., Tuncali, C.E., Fainekos, G.: An efficient algorithm for monitoring practical TPTL specifications. In: International Conference on Formal Methods and Models for System Design (MEMOCODE), pp. 184–193. IEEE (2016)
18.
Zurück zum Zitat Havelund, K., Peled, D., Ulus, D.: First order temporal logic monitoring with BDDs. In: Formal Methods in Computer-Aided Design FMCAD 2017, p. 116 (2017) Havelund, K., Peled, D., Ulus, D.: First order temporal logic monitoring with BDDs. In: Formal Methods in Computer-Aided Design FMCAD 2017, p. 116 (2017)
19.
Zurück zum Zitat Havelund, K., Roşu, G.: Monitoring Java programs with Java pathexplorer. Electron. Notes Theor. Comput. Sci. 55(2), 200–217 (2001)CrossRef Havelund, K., Roşu, G.: Monitoring Java programs with Java pathexplorer. Electron. Notes Theor. Comput. Sci. 55(2), 200–217 (2001)CrossRef
22.
Zurück zum Zitat Hunter, P., Ouaknine, J., Worrell, J.: Expressive completeness for metric temporal logic. In: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp. 349–357. IEEE Computer Society (2013) Hunter, P., Ouaknine, J., Worrell, J.: Expressive completeness for metric temporal logic. In: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp. 349–357. IEEE Computer Society (2013)
23.
Zurück zum Zitat Kim, M., Viswanathan, M., Kannan, S., Lee, I., Sokolsky, O.: Java-MaC: a run-time assurance approach for Java programs. Form. Methods Syst. Des. 24(2), 129–155 (2004)CrossRef Kim, M., Viswanathan, M., Kannan, S., Lee, I., Sokolsky, O.: Java-MaC: a run-time assurance approach for Java programs. Form. Methods Syst. Des. 24(2), 129–155 (2004)CrossRef
24.
Zurück zum Zitat Koubarakis, M.: Complexity results for first-order theories of temporal constraints. In: International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 379–390 (1994) Koubarakis, M.: Complexity results for first-order theories of temporal constraints. In: International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 379–390 (1994)
25.
Zurück zum Zitat Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Syst. 2(4), 255–299 (1990)CrossRef Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Syst. 2(4), 255–299 (1990)CrossRef
27.
Zurück zum Zitat Maler, O., Nickovic, D.: Monitoring properties of analog and mixed-signal circuits. STTT 15(3), 247–268 (2013)CrossRef Maler, O., Nickovic, D.: Monitoring properties of analog and mixed-signal circuits. STTT 15(3), 247–268 (2013)CrossRef
28.
Zurück zum Zitat Markey, N., Raskin, J.-F.: Model checking restricted sets of timed paths. Theor. Comput. Sci. 358(2–3), 273–292 (2006)MathSciNetCrossRef Markey, N., Raskin, J.-F.: Model checking restricted sets of timed paths. Theor. Comput. Sci. 358(2–3), 273–292 (2006)MathSciNetCrossRef
30.
Zurück zum Zitat Pnueli, A.: The temporal logic of programs. In: Annual Symposium on Foundations of Computer Science, SFCS 1977, pp. 46–57. IEEE Computer Society, Washington, D.C. (1977) Pnueli, A.: The temporal logic of programs. In: Annual Symposium on Foundations of Computer Science, SFCS 1977, pp. 46–57. IEEE Computer Society, Washington, D.C. (1977)
31.
Zurück zum Zitat Raskin, J.-F.: Logics, automata and classical theories for deciding real time. Ph.D. thesis, Université de Namur (1999) Raskin, J.-F.: Logics, automata and classical theories for deciding real time. Ph.D. thesis, Université de Namur (1999)
32.
Zurück zum Zitat Stolz, V., Bodden, E.: Temporal assertions using AspectJ. Electron. Notes Theor. Comput. Sci. 144(4), 109–124 (2006)CrossRef Stolz, V., Bodden, E.: Temporal assertions using AspectJ. Electron. Notes Theor. Comput. Sci. 144(4), 109–124 (2006)CrossRef
Metadaten
Titel
Monitoring Temporal Logic with Clock Variables
verfasst von
Adrián Elgyütt
Thomas Ferrère
Thomas A. Henzinger
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-030-00151-3_4