betaFeedback

WorksComputer Science

On the monitorability of linear-time timed logics

Abstract

In [10], we solved the monitorability problem for Tlin , a new expressive (linear-time) timed mu-calculus that we proposed. We showed that Tlin is strictly more expressive than MTL, the de facto timed extension of the well-known LTL. Moreover, we identified MTlin , the largest monitorable fragment of Tlin. The maximality of MTlin was proven modulo an expressive monitoring framework called Mon, yet under the assumption of reactivity. Our work in [10] was the first to solve the monitorability problem for such an expressive timed logic, and its theoretical results were accompanied with compilers (i) from MTL to Tlin and (ii) from Tlin formulae to monitors. This paper is an extension of [10] with the following new contributions. First, we generalise the maximality results to arbitrary monitors, which include both reactive and non-reactive monitors. Second, we extend the expressiveness results of Tlin . We completely revise the embedding of MTL into Tlin : we show that the syntax of MTL given in [10] was incomplete, and provide a new compiler from MTL, under its standard syntax with the strict Until operator and negation over arbitrary formulae, into Tlin . In passing, we demonstrate that Tlin is closed under complement and provide a fully syntactic complementation procedure. Moreover, we prove that Tlin is strictly more expressive than TPTL, a popular timed logic more expressive than MTL, and develop an automatic embedding from TPTL to Tlin . This gives Tlin and the machinery around it the power of a unified framework to reason on the monitorability of linear-time timed logics. Accordingly, we identify important monitorable fragments for both MTL and TPTL.

2012 ACM Subject Classification Theory of computation →\to Logic and verification

© Author: Please provide a copyright holder; licensed under Creative Commons License CC-BY 4.0

Leibniz International Proceedings in Informatics

Schloss Dagstuhl — Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

Digital Object Identifier 10.4230/LIPIcs...

Funding This work has received support from the ANR project ERVoRS (ANR-25-CE48-6220).

Introduction

Runtime Verification (RV) is a lightweight formal verification technique [39, 14], where the system at hand is instrumented with monitors [27, 28]. Each monitor MM is a software component that corresponds to a logical formula ϕ\phi expressing some property of interest. At runtime, MM incrementally analyses the execution of the system until it reaches a verdict w.r.t. the satisfaction or violation of ϕ\phi [39, 2]. RV can mitigate two major drawbacks of exhaustive, offline techniques such as model checking. First, by trading exhaustiveness for scalability, RV does not suffer from the well-known state-space explosion problem. Second, provided that actions of interest are visible for instrumentation purposes, RV is suitable for systems where no model is known beforehand [26], e.g., black-box and self-adaptive systems [42].

Due to the lack of exhaustiveness, the delineation between the properties that can be handled by RV and those that cannot, i.e., the monitorability problem, becomes a central issue [49, 14, 3, 10, 31]. Intuitively, a formula ϕ\phi is monitorable iff its violation or satisfaction can be detected by a monitor. Consider for instance the following property:

“every request is eventually followed by a grant”

The above classical “leads to” property can be formalised in e.g., LTL, and there exists algorithms to model-check it offline [40, 19, 57]; it is however not monitorable. Indeed, any satisfaction verdict after a grant may be contradicted by a future request not followed by a grant (and dually, any violation verdict after a request may be contradicted by a future grant). In technical terms, a formula ϕ\phi, expressing some property of interest, is said to be satisfaction (resp. violation) monitorable iff there exists a monitor for ϕ\phi that is both sound and satisfaction (resp. violation) complete [2, 26] (other definitions of monitorability will be discussed in § 8). Formula ϕ\phi is said monitorable iff it is satisfaction or violation monitorable, and complete monitorable iff it is both satisfaction and violation monitorable. The monitorability problem is thus concerned with determining the largest monitorable subset of a given logic LL.

The monitorability problem has been studied for the modal μ\mu-calculus, also known as the Hennessy-Milner Logic with recursion (μ\mu-HML) [37, 38]. Notably, the maximally-expressive monitorable subset of μ\mu-HML, i.e., a subset within which any monitorable formula in μ\mu-HML is expressible, has been identified for both linear-time and branching-time semantics [2, 26]. However, μ\mu-HML is untimed, and thus cannot express timed properties such as the following bounded response property

“every request is eventually followed by a grant within 5 time units”

Timed properties are extremely important in real-time systems, ubiquitous nowadays (see e.g., [44, 23]). There is therefore an urgent need to tackle the monitorability problem for timed logics. Even though the body of research on RV for timed systems is extensive (more in § 8), there was, until very recently, no work that studied monitorability in a timed setting.

In 2025, the first works around timed monitorability emerged throughout two consecutive papers. The earlier one is ours [10], where we solved the monitorability problem for an expressive timed logic that we proposed, namely TlinT^{\mathrm{lin}}. The present paper is an extension of [10] (see below). The later one [31], providing decidability results on monitorability of ω\omega timed regular languages, will be discussed § 8.

Contributions.

This paper is an extension of [10] which enclosed the following contributions. First, we propose TlinT^{lin}, a new1 timed μ\mu-calculus with a linear-time interpretation, i.e., the semantics of a formula in TlinT^{lin} is defined as a set of infinite timed executions that satisfy it. In particular, we prove that TlinT^{lin} is strictly more expressive than MTL. Second, we develop a rich monitoring language called Mon, and solve the monitorability problem for TlinT^{lin} within Mon and under the assumption of reactivity of monitors. We precisely identify VTlinVT^{lin}, STlinST^{lin} and CTlinCT^{lin}, the largest fragments (i.e., maximally-expressive subsets) of TlinT^{lin} that are violation monitorable, satisfaction monitorable and complete monitorable, respectively, and accordingly conclude that MTlin=VTlin∪STlinMT^{lin} = VT^{lin} \cup ST^{lin} is the largest monitorable fragment of TlinT^{lin}. For practical reasons, we also provide automatic translators (i) from MTL to TlinT^{lin} and (ii) from TlinT^{lin} to Mon.

In addition to the above contributions of [10], this extension comprises the following new results:

  • Section 3.2 is new. In it, we prove that TlinT^{lin} is closed under complement using a fully syntactic complementation procedure. This is necessary to handle negation in the new translation from MTL to TlinT^{lin} (see below).

  • Section 3.3 is completely revised and substantially extended:

    • We completely revise our compiler from MTL to TlinT^{lin} (§ 3.5.1). We show that the syntax of MTL in [10], proposed in negative normal form was incomplete, leading to a semantics that cannot capture the negation of Until formulae (Remark 2.11). To demonstrate that this under-characterisation does not impair the expressiveness results, i.e., the containment of MTL in TlinT^{lin}, we fall back on the standard syntax of MTL with the strict Until operator and negation over arbitrary formulae (§ 2.4.1) and develop a new compiler thereof from MTL to TlinT^{lin} that we prove correct.

    • We show that TlinT^{lin} does not only embed MTL, but also the more expressive TPTL, and provide accordingly an automatic compiler from TPTL to TlinT^{lin} that we prove correct (§ 3.5.2).

    • We demonstrate that TlinT^{lin} is strictly more expressive than TPTL and therefore strictly more expressive than MTL (§ 3.5.3), establishing therefore a strict expressiveness hierarchy between the three logics (Figure 8).

  • In the new § 4.6, we generalise the monitorability results of TlinT^{lin} to a more flexible monitoring framework, where monitors do not have to be reactive by design, and therefore extend our maximality results to arbitrary monitors in Mon.

  • In the new Section 6 and Section 7, we use TlinT^{lin} and the machinery around it (compilations from MTL and TPTL to TlinT^{lin}, and from TlinT^{lin} to Mon) as a unified framework to generalise the monitorability results to both MTL and TPTL. In particular, we show that the depth of formulae in MTL does not impact the monitorability within the identified fragments. More precisely, every MTL formula ϕ\phi is satisfaction (resp. violation) monitorable as long as every unconstrained Until sub-formula of ϕ\phi is in the scope of an even (resp. odd) number of negations.

Figure 8. Expressiveness of TlinT^{lin}

Section 8 is substantially extended to include a comparison with [31], a very recent work on monitorability that appeared after the publication of [10]. To the best of our knowledge, this is the first complete work on timed monitorability of prominent linear-time timed logics within a unified framework.

Outline.

The rest of this paper is organised as follows. After overviewing the preliminaries in § 2, we discuss our core contribution in Section 3 through § 7. Section 3 defines our logic TlinT^{lin} and proves that it is more expressive than MTL (resp. TPTL), providing along the way an automatic translation from MTL (resp. TPTL) to TlinT^{lin}. In § 4, we lay out our theoretical foundations for timed monitors and instrumentation. We then tackle the monitorability problem of TlinT^{lin} in Section 5. In § 6, we identify important fragments of MTL with violation-, satisfaction- and complete-monitorable formulae. In § 7, we identify analogously monitorable fragments of TPTL. § 8 compares our contributions with related work and § 9 wraps up with concluding remarks and future work directions.

Proofs. In order to avoid redundancy, only the proofs related to new contributions w.r.t. [10] are enclosed in the present paper. The locations of the remaining proofs within [10] are referred to whenever needed throughout the remainder of this paper.

Preliminaries

In this section, we introduce preliminary notions on TLTSs and timed temporal logics (MTL and TPTL). All definitions are action based, i.e., rely on the actions a system under scrutiny may perform [39]. In the remainder of this paper, we denote by Act\mathrm{Act} a non-empty, finite set of such actions.

Timed Labelled Transition Systems

The following definition is inspired from [1].

Definition 2.1. A Timed Labelled Transition System (TLTS) PP over Act\mathrm{Act} is a tuple ⟨SP,Lab,→P⟩\langle S_P,\mathrm{Lab},\mathrel{\to_P}\rangle where SPS_P is a set of states, Lab=Act∪R≥0∪{τ}\mathrm{Lab}=\mathrm{Act}\cup\mathbb{R}_{\ge0}\cup\{\tau\} a set of labels, and →P⊆SP×Lab×SP\mathrel{\to_P}\subseteq S_P\times\mathrm{Lab}\times S_P the transition relation satisfying:

  1. Time determinism: for every p,p′,p′′∈SPp,p',p''\in S_P and d∈R≥0d\in\mathbb{R}_{\ge0}, if (p,d,p′)∈→P(p,d,p')\in\mathrel{\to_P} and (p,d,p′′)∈→P(p,d,p'')\in\mathrel{\to_P} then p′=p′′p'=p'',

  2. Time additivity: for every p,p′′∈SPp,p''\in S_P and d1,d2∈R≥0d_1,d_2\in\mathbb{R}_{\ge0}, (p,d1+d2,p′′)∈→P(p,d_1+d_2,p'')\in\mathrel{\to_P} iff (p,d1,p′)∈→P(p,d_1,p')\in\mathrel{\to_P} and (p′,d2,p′′)∈→P(p',d_2,p'')\in\mathrel{\to_P} from some p′∈SPp'\in S_P,

  3. Zero delay: for every p,p′∈SPp,p'\in S_P, (p,0,p′)∈→P(p,0,p')\in\mathrel{\to_P} iff p′=pp'=p.

A transition labelled α∈Act\alpha\in\mathrm{Act} (resp. α∈R≥0\alpha\in\mathbb{R}_{\ge0}) is a called an action transition (resp. delay transition). A τ\tau transition is a non-observable transition labelled with the special symbol τ\tau. We use a,ai,b,ca,a_i,b,c and d,did,d_i to denote, respectively, an element of Act\mathrm{Act} and R≥0\mathbb{R}_{\ge0}. We recall that Act\mathrm{Act} is finite. In the following, we write p1→α1p2→α2p3…p_1\xrightarrow{\alpha_1}p_2\xrightarrow{\alpha_2}p_3\ldots to denote a sequence of transitions with (p1,α1,p2),(p2,α2,p3)…∈→P(p_1,\alpha_1,p_2),(p_2,\alpha_2,p_3)\ldots\in\mathrel{\to_P}.

Runs.

A run in the TLTS PP is a sequence of labels (in Labω∪Lab∗=Lab∞\mathrm{Lab}^{\omega} \cup\mathrm{Lab}^{*} = \mathrm{Lab}^{\infty}) corresponding to a sequence of transitions. For example, if p1→α1p2→α2p3p_{1} \xrightarrow{\alpha_{1}} p_{2} \xrightarrow{\alpha_{2}} p_{3} then θ=α1α2∈Lab∗\theta= \alpha_{1}\alpha_{2} \in\mathrm{Lab}^{*} is a finite run feasible from p1p_{1}. If there exists an infinite transition sequence p1→α1p2→α2p3→α3…p_{1} \xrightarrow{\alpha_{1}} p_{2} \xrightarrow{\alpha_{2}} p_{3} \xrightarrow{\alpha_{3}} \ldots, we say that run θ=α1α2α3…∈Labω\theta= \alpha_{1}\alpha_{2}\alpha_{3}\ldots\in\mathrm{Lab}^{\omega} is infinite from p1∈SPp_{1} \in S_{P}.

Weak runs.

Let L=Lab∖{τ}\mathcal{L} = \mathrm{Lab} \setminus\{\tau\}. To define weak transitions, we write p⟶p′p \longrightarrow p' instead of p(→τ)∗p′p \left(\xrightarrow{\tau}\right)^{*} p' which is the reflexive-transitive closure of the relation →τ\xrightarrow{\tau}, and following [58], we write p→αp′p \xrightarrow{\alpha} p' for α∈L\alpha\in\mathcal{L} in the following cases,

  • (a) p→ap′p \xrightarrow{a} p' if p⟶⋅→a⋅⟶p′p \longrightarrow\mathord{\cdot} \xrightarrow{a} \mathord{\cdot} \longrightarrow p',

  • (b) p→dp′p \xrightarrow{d} p' if there exists n≥0n \ge0 s.t. p⟶⋅→d0⋅⟶⋅→d1⋅…→dn⋅⟶p′p \longrightarrow\mathord{\cdot} \xrightarrow{d_{0}} \mathord{\cdot} \longrightarrow\mathord{\cdot} \xrightarrow{d_{1}} \mathord{\cdot} \ldots\xrightarrow{d_{n}} \mathord{\cdot} \longrightarrow p' where d=∑i≤ndid = \sum_{i \le n} d_{i},

References

  1. [1]L. Aceto, A. Ingólfsdóttir, K. G. Larsen, and J. Srba. Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, 2007.
  2. [2]Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen. Adventures in monitorability: from branching to linear time and back again. Proc. ACM Program. Lang., 3(POPL):52:1–52:29, 2019.DOI
  3. [3]Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen. An operational guide to monitorability. In International Conference on Software Engineering and Formal Methods (SEFM), pages 433–453. Springer, 2019.arxiv.org/abs/1906.00766
  4. [4]Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen. An operational guide to monitorability with applications to regular properties. Software and Systems Modeling, 20:335–361, 2021.
  5. [5]R. Alur and D. Dill. The theory of timed automata. In Workshop/School/Symposium of the REX Project (Research and Education in Concurrent Systems), 1991.
  6. [6]Rajeev Alur, Tomás Feder, and Thomas A. Henzinger. The benefits of relaxing punctuality. J. ACM, 43(1):116–146, 1996.
  7. [7]Rajeev Alur and Thomas A Henzinger. Real-time logics: complexity and expressiveness. Information and Computation, 104(1):35–77, 1993.
  8. [8]Rajeev Alur and Thomas A Henzinger. A really temporal logic. Journal of the ACM (JACM), 41(1):181–203, 1994.
  9. [9]Rajeev Alur and Thomas A Henzinger. Modularity for timed and hybrid systems. In International Conference on Concurrency Theory (CONCUR), pages 74–88. Springer, 1997.
  10. [10]Mouloud Amara, Giovanni Bernardi, Mohammed Aristide Foughali, and Adrian Francalanza. A Theory of (Linear-Time) Timed Monitors. In Jonathan Aldrich and Alexandra Silva, editors, 39th European Conference on Object-Oriented Programming, ECOOP 2025, Bergen, Norway, June 30 - July 2, 2025, volume 333 of LIPIcs, pages 1:1–1:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. Full version with proofs at https://hal.science/hal-05043055/document.
  11. [11]Mouloud Amara, Giovanni Bernardi, Mohammed Aristide Foughali, and Adrian Francalanza. A theory of (linear-time) timed monitors (artifact). Dagstuhl Artifacts Series, 11(2):8–1, 2025.
  12. [12]André Arnold and Damian Niwinski. Rudiments of μ-calculus. 2001.
  13. [13]Kevin Baldor and Jianwei Niu. Monitoring dense-time, continuous-semantics, metric temporal logic. In International Conference on Runtime Verification (RV), pages 245–259. Springer, 2012.DOI
  14. [14]Ezio Bartocci, Vliès Falcone, Adrian Francalanza, and Giles Reger. Introduction to runtime verification. Lectures on Runtime Verification: Introductory and Advanced Topics, pages 1–33, 2018.DOI
  15. [15]David A. Basin, Felix Klaedtke, Samuel Müller, and Eugen Zaliṅescu. Monitoring metric first-order temporal properties. J. ACM, 62(2):15:1–15:45, 2015.DOI
  16. [16]Andreas Bauer, Martin Leucker, and Christian Schallhart. Runtime verification for LTL and TLTL. ACM Trans. Softw. Eng. Methodol., 20(4):14:1–14:64, 2011.DOI
  17. [17]Patricia Bouyer, Fabrice Chevalier, and Nicolas Markey. On the expressiveness of TPTL and MTL. In International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 432–443. Springer, 2005.
  18. [18]Patricia Bouyer, B Srivathsan, and Vaishnavi Vishwanath. A simple obligation to metric interval temporal logic. arXiv preprint arXiv:2607.13598, 2026.arxiv.org/abs/2607.13598
  19. [19]Edmund Clarke, Orna Grumberg, and Kiyoharu Hmaguchi. Another look at LTL model checking. In International Conference on Computer Aided Verification (CAV), pages 415–427. Springer, 1994.
  20. [20]Rance Cleaveland, Jeroen JA Keiren, and Peter Fontana. An expressive timed modal mu-calculus for timed automata. In International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems (QEST+FORMATS), pages 160–178. Springer, 2024.
  21. [21]Christian Dax, Martin Hofmann, and Martin Lange. A proof system for the linear time μ-calculus. In S. Arun-Kumar and Naveen Garg, editors, International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 273–284. Springer, 2006.
  22. [22]Alexandre Donzé and Oded Maler. Robust satisfaction of temporal logic over real-valued signals. In International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), pages 92–106. Springer, 2010.
  23. [23]Mohammed Foughali, Saddek Bensalem, Jacques Combáz, and Félix Ingrand. Runtime verification of timed properties in autonomous robots. In International Conference on Formal Methods and Models for System Design (MEMOCODE), pages 1–12. IEEE, 2020.
  24. [24]Mohammed Foughali, Pierre-Emmanuel Hladik, and Alexander Zuepke. Compositional verification of embedded real-time systems. J. Syst. Archit., 142:102928, 2023.
  25. [25]Mohammed Aristide Foughali. Revisiting the expressiveness of metric temporal logic. In Andrea Orlandini and Sophie Pinchinat, editors, 33rd International Symposium on Temporal Representation and Reasoning, TIME 2026, Cork, Ireland, September 1-3, 2026, volume 146 of OASIcs, pages 1:1–1:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
  26. [26]A. Francalanza, L. Aceto, and A. Ingólfsdóttir. Monitorability for the Hennessy-Milner logic with recursion. Formal Methods Syst. Des., 51(1), 2017.DOI
  27. [27]Adrian Francalanza. A theory of monitors. Inf. Comput., 281:104704, 2021.
  28. [28]Adrian Francalanza, Luca Aceto, Antonis Achilleos, Duncan Paul Attard, Ian Cassar, Dario Della Monica, and Anna Ingólfsdóttir. A foundation for runtime monitoring. In RV, volume 10548 of Lecture Notes in Computer Science, pages 8–29. Springer, 2017.DOI
  29. [29]Adrian Francalanza and Clare Cini. Computer says no: Verdict explainability for runtime monitors using a local proof system. J. Log. Algebraic Methods Program., 119:100636, 2021.DOI
  30. [30]Carlo Alberto Furia and Matteo Rossi. On the expressiveness of mtl variants over dense time. In International Conference on Formal Modeling and Analysis of Timed Systems, pages 163–178. Springer, 2007.DOI
  31. [31]Thomas Møller Großen, Sean Kauffman, Kim G. Larsen, and Martin Zimmermann. Time for timed monitorability. In Patricia Bouyer and Jaco van de Pol, editors, 36th International Conference on Concurrency Theory, CONCUR 2025, Aarhus, Denmark, August 26-29, 2025, volume 348 of LIPIcs, pages 19:1–19:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
  32. [32]Thomas Møller Großen, Sean Kauffman, Kim Guldstrand Larsen, and Martin Zimmermann. Monitoring timed properties (revisited). In International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), pages 43–62. Springer, 2022.
  33. [33]Thomas A Henzinger. Sooner is safer than later. Information Processing Letters, 43(3):135–141, 1992.
  34. [34]Hsi-Ming Ho, Joël Ouaknine, and James Worrell. Online monitoring of metric temporal logic. In International Conference on Runtime Verification (RV), pages 178–192. Springer, 2014.DOI
  35. [35]Donald Ervin Knuth. Semantics of context-free languages. Mathematical systems theory, 2:127–145, 1968.DOI
  36. [36]Ron Koymans. Specifying real-time properties with metric temporal logic. Real-time systems, 2(4):255–299, 1990.DOI
  37. [37]Dexter Kozen. Results on the propositional μ-calculus. Theoretical computer science, 27(3):333–354, 1983.
  38. [38]Kim G Larsen. Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoretical Computer Science, 72(2-3):265–288, 1990.DOI
  39. [39]Martin Leucker and Christian Schallhart. A brief account of runtime verification. The journal of logic and algebraic programming, 78(5):293–303, 2009.DOI
  40. [40]Orna Lichtenstein and Amir Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Symposium on Principles of Programming Languages (POPL), pages 97–107, 1985.DOI
  41. [41]Leonardo Lima, Andrei Herasimau, Martin Raszyk, Dmitriy Traytel, and Simon Yuan. Explainable online monitoring of metric temporal logic. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 473–491. Springer, 2023.DOI
  42. [42]Frank D Macías-Escrivá, Rodolfo Haber, Raul Del Toro, and Vicente Hernandez. Self-adaptive systems: A survey of current approaches, research challenges and applications. Expert Systems with Applications, 40(18):7267–7279, 2013.
  43. [43]Oded Maler and Dejan Nickovic. Monitoring temporal properties of continuous signals. In International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT), volume 3253, pages 152–166. Springer, 2004.DOI
  44. [44]Oded Maler, Dejan Nickovic, and Amir Pnueli. On synthesizing controllers from bounded-response properties. In International Conference on Computer Aided Verification (CAV), pages 95–107. Springer, 2007.DOI
  45. [45]Joël Ouaknine and James Worrell. On the decidability of metric temporal logic. In 20th Annual IEEE Symposium on Logic in Computer Science (LICS’05), pages 188–197. IEEE, 2005.DOI
  46. [46]Joël Ouaknine and James Worrell. On metric temporal logic and faulty turing machines. In International Conference on Foundations of Software Science and Computation Structures, pages 217–230. Springer, 2006.DOI
  47. [47]Joël Ouaknine and James Worrell. Some recent results in metric temporal logic. In International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), pages 1–13. Springer, 2008.DOI
  48. [48]Srinivas Pinisetty, Thierry Jéron, Stavros Tripakis, Yliès Falcone, Hervé Marchand, and Viorel Preoteasa. Predictive runtime verification of timed properties. Journal of Systems and Software, 132:353–365, 2017.
  49. [49]Amir Pnueli and Aleksandr Zaks. PSL model checking and run-time verification via testers. In International Symposium on Formal Methods (FM), pages 573–586. Springer, 2006.
  50. [50]Pavithra Prabhakar and Deepak D’Souza. On the expressiveness of MTL with past operators. In International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), pages 322–336. Springer, 2006.DOI
  51. [51]Martin Razsky, David Basin, Srđan Krstić, and Dmitriy Traytel. Multi-head monitoring of metric temporal logic. In International Symposium on Automated Technology for Verification and Analysis (ATVA), pages 151–170. Springer, 2019.
  52. [52]Neha Rino, Mohammed Foughali, and Eugene Asarin. Efficiently computable distance-based robustness for a practical fragment of stl. In International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems (QEST+FORMATS), pages 179–195. Springer, 2024.DOI
  53. [53]Victor Roussanaly and Yliès Falcone. Decentralised runtime verification of timed regular expressions. In International Symposium on Temporal Representation and Reasoning (TIME), pages 61–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
  54. [54]Fred B. Schneider. Enforceable security policies. ACM Trans. Inf. Syst. Secur., 3(1):30–50, 2000.
  55. [55]Prasanna Thati and Grigore Roşu. Monitoring algorithms for metric temporal logic specifications. Electronic Notes in Theoretical Computer Science, 113:145–162, 2005.DOI
  56. [56]Dogan Ulus, Thomas Ferrère, Eugene Asarin, and Oded Maler. Online timed pattern matching using derivatives. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 736–751. Springer, 2016.DOI
  57. [57]Moshe Y. Vardi. An automata-theoretic approach to linear temporal logic. Logics for concurrency: structure versus automata, pages 238–266, 2005.
  58. [58]W. Yi. Real-time behaviour of asynchronous agents. In International Conference on Concurrency Theory (CONCUR), 1990.

Paper details

vlnc:W_em6w2mud
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 9

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents