An Introduction to Timed Automata

Pandya, Paritosh K.; Suman, P. Vijay

doi:10.1142/9789814271059_0004

Cited by 2 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Given two timed automata B and C, we let B × C denote their product defined in the standard way (see e.g. [21]). The following is straightforward.…”

Section: ⊓ ⊔mentioning

confidence: 99%

A Boyer-Moore Type Algorithm for Timed Pattern Matching

Waga¹,

Akazaki²,

Hasuo³

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The timed pattern matching problem is formulated by Ulus et al. and has been actively studied since, with its evident application in monitoring realtime systems. The problem takes as input a timed word/signal and a timed pattern (specified either by a timed regular expression or by a timed automaton); and it returns the set of those intervals for which the given timed word, when restricted to the interval, matches the given pattern. We contribute a Boyer-Moore type optimization in timed pattern matching, relying on the classic Boyer-Moore string matching algorithm and its extension to (untimed) pattern matching by Watson and Watson. We assess its effect through experiments; for some problem instances our Boyer-Moore type optimization achieves speed-up by two times, indicating its potential in real-world monitoring tasks where data sets tend to be massive.

show abstract

“…Given two timed automata B and C, we let B × C denote their product defined in the standard way (see e.g. [21]). The following is straightforward.…”

Section: ⊓ ⊔mentioning

confidence: 99%

A Boyer-Moore Type Algorithm for Timed Pattern Matching

Waga¹,

Akazaki²,

Hasuo³

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

A Logical Characterization of Timed (non-)Regular Languages

Bersani

Rossi

Pietro

2014

Mathematical Foundations of Computer Science 2014

View full text Add to dashboard Cite

Abstract. CLTLoc (Constraint LTL over clocks) is a quantifier-free extension of LTL allowing variables behaving like clocks over real numbers. CLTLoc is in PSPACE [9] and its satisfiability can polynomially be reduced to a SMT problem, allowing a feasible implementation of a decision procedure. We used CLTLoc to capture the semantics of metric temporal logics over continuous time, such as Metric Interval Temporal Logic (MITL), resulting in the first successful implementation of a tool for checking MITL satisfiability [7]. In this paper, we assess the expressive power of CLTLoc, by comparing it with various temporal formalisms over dense time. When interpreted over timed words, CLTLoc is equivalent to Timed Automata. We also define a monadic theory of orders, extending the one introduced by Kamp, which is expressively equivalent to CLTLoc. We investigate a decidable extension with an arithmetical next operator, which allows the expression of timed non-ω-regular languages.

show abstract

An Introduction to Timed Automata

Cited by 2 publications

References 0 publications

A Boyer-Moore Type Algorithm for Timed Pattern Matching

A Boyer-Moore Type Algorithm for Timed Pattern Matching

A Logical Characterization of Timed (non-)Regular Languages

Contact Info

Product

Resources

About