A Logical Characterisation of Event Clock Automata

D’Souza, Deepak

doi:10.1142/s0129054103001923

Cited by 19 publications

(17 citation statements)

References 9 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We base our ideas on the timed lineartime temporal logic (TLTL), a logic originally introduced by Raskin in [Raskin 1999]. TLTL, as argued by D'Souza, can be considered a natural counterpart of LTL in the timed setting: He showed in [D'Souza 2003] that, over timed traces, TLTL is equally expressive as first-order logic, transferring Kamp's famous result that, over words, LTL and first-order logic coincide with respect to expressiveness [Kamp 1968] to the world of real-time systems.…”

Section: Monitoring Of Real-time Propertiesmentioning

confidence: 99%

See 1 more Smart Citation

Runtime Verification for LTL and TLTL

Bauer

Leucker

Schallhart

2011

ACM Trans. Softw. Eng. Methodol.

469

513

View full text Add to dashboard Cite

This paper studies runtime verification of properties expressed either in lineartime temporal logic (LTL) or timed lineartime temporal logic (TLTL). It classifies runtime verification in identifying its distinguishing features to model checking and testing, respectively. It introduces a three-valued semantics (with truth values true, false, inconclusive) as an adequate interpretation as to whether a partial observation of a running system meets an LTL or TLTL property.For LTL, a conceptually simple monitor generation procedure is given, which is optimal in two respects: First, the size of the generated deterministic monitor is minimal, and, second, the monitor identifies a continuously monitored trace as either satisfying or falsifying a property as early as possible. The feasibility of the developed methodology is demontrated using a collection of real-world temporal logic specifications. Moreover, the presented approach is related to the properties monitorable in general and is compared to existing concepts in the literature. It is shown that the set of monitorable properties does not only encompass the safety and co-safety properties but is strictly larger.For TLTL, the same road map is followed by first defining a three-valued semantics. The corresponding construction of a timed monitor is more involved, yet, as shown, possible.

show abstract

Section: Monitoring Of Real-time Propertiesmentioning

confidence: 99%

“…The semantics of ¡ a ∈ I is that γ(x a ) ∈ I must hold at the point of evaluation, and analogously, in case of £ a ∈ I, it is required that γ(y a ) ∈ I holds. This timed variant of LTL is taken from [D'Souza 2003] where it is called LTL ec .…”

Section: Syntax and Semantics Of Tltlmentioning

confidence: 99%

Runtime Verification for LTL and TLTL

Bauer

Leucker

Schallhart

2011

ACM Trans. Softw. Eng. Methodol.

469

513

View full text Add to dashboard Cite

show abstract

“…These strings, which are built-up from letters of actions and constraints, are sometimes also called symbolic strings. It has been shown that the set of symbolic strings accepted by an (event-deterministic) event-recording automaton forms a regular language [27], which we call the symbolic regular language of the automaton. The second obstacle to overcome is to derive a form or Nerode's right congruence for such symbolic regular languages that is consistent with a natural notion of right congruence for timed systems.…”

Section: Learning Of Timed Systemsmentioning

confidence: 99%

Learning Meets Verification

Leucker¹

2007

Formal Methods for Components and Objects

View full text Add to dashboard Cite

show abstract

“…This class enjoys good closure properties such as determinization and complementation. It has thus attracted attention to characterize its expressive power in terms of some timed logic [13,8], but logics considered there are linear-time. This paper investigates the problem of constructing characteristic formulae for the class of event-recording automata, up to timed similarity and timed bisimilarity, using a branching-time logic devoted to event-based timed specifications.…”

Section: Introductionmentioning

confidence: 99%

On characteristic formulae for Event-Recording Automata

Timo

Reynier

2013

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

Abstract. A standard bridge between automata theory and logic is provided by the notion of characteristic formula. This paper investigates this problem for the class of event-recording automata (ERA), a subclass of timed automata in which clocks are associated with actions and that enjoys very good closure properties (complementation, determinization...). We first study the problem of expressing characteristic formulae for ERA in Event-Recording Logic (ERL), a logic introduced by Sorea to express event-based timed specifications. We prove that the construction proposed by Sorea for ERA without invariants is false. More generally, we prove that bisimulation can not be expressed in ERL for the class of ERA, even without invariants. Then, we introduce the logic WTµ, a new logic for event-based timed specifications, closer to the timed logic Lν . We prove that it is strictly more expressive than ERL, and that its model-checking problem against ERA is EXPTIME-complete. Finally, we provide constructions for characterizing ERA up to timed (bi)similarity and study the complexity issues.

show abstract

A Logical Characterisation of Event Clock Automata

Cited by 19 publications

References 9 publications

Runtime Verification for LTL and TLTL

Runtime Verification for LTL and TLTL

Learning Meets Verification

On characteristic formulae for Event-Recording Automata

Contact Info

Product

Resources

About