Real-Time Logics: Complexity and Expressiveness

Alur, Rajeev; Henzinger, Thomas A.

doi:10.1006/inco.1993.1025

Cited by 303 publications

(218 citation statements)

References 32 publications

Supporting

Mentioning

201

Contrasting

Order By: Relevance

“…Then the formula t-sr(<p) in LTL(T) is obtained by replacing subformulas of the form a by V (M, (b,g) The translation s-t((p) for a formula (p in LTL(r) is defined in the expected manner, as done in Sec. 3.…”

Section: ) Ltl(a) Is Expressively Equivalent To Fo(a) •mentioning

confidence: 99%

A Logical Characterisation of Event Clock Automata

D’Souza

2003

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

We show that the class of Event Clock Automata [2] admit a logical characterisation via an unrestricted monadic second order logic interpreted over timed words. The result is interesting in that it provides an unrestricted yet decidable logical characterisation of a non-trivial class of timed languages. A timed temporal logic considered earlier in the literature [11] is shown to be expressively complete with respect to the monadic logic.

show abstract

Section: ) Ltl(a) Is Expressively Equivalent To Fo(a) •mentioning

confidence: 99%

A Logical Characterisation of Event Clock Automata

D’Souza

2003

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…a (timed) Declare model at runtime. In particular, to express metric temporal constraints in Declare, we extend the original LTL semantics of Declare with Metric Temporal Logic (MTL), 8,9 a real-time extension of LTL with quantitative temporal operators. MTL reasons over infinite traces.…”

Section: Introductionmentioning

confidence: 99%

Using Timed Automata for a Priori Warnings and Planning for Timed Declarative Process Models

Maggi

Westergaard

2014

Int. J. Coop. Info. Syst.

View full text Add to dashboard Cite

Many processes are characterized by high variability, making traditional process modeling languages cumbersome or even impossible to be used for their description. This is especially true in cooperative environments relying heavily on human knowledge. Declarative languages, like Declare, alleviate this issue by not describing what to do step-by-step but by defining a set of constraints between actions that must not be violated during the process execution. Furthermore, in modern cooperative business, time is of utmost importance. Therefore, declarative process models should be able to take this dimension into consideration. Timed Declare has already previously been introduced to monitor temporal constraints at runtime, but it has until now only been possible to provide an alert when a constraint has already been violated without the possibility of foreseeing and avoiding such violations. In this paper, we introduce an extended version of Timed Declare with a formal timed semantics for the entire language. The semantics degenerates to the untimed semantics in the expected way. We also introduce a translation to timed automata, which allows us to detect inconsistencies in models prior to execution and to early detect that a certain task is time sensitive. This means that either the task cannot be executed after a deadline (or before a latency), or that constraints are violated unless it is executed before (or after) a certain time. This makes it possible to use declarative process models to provide a priori guidance instead of just a posteriori detecting that an execution is invalid. We also outline how a Declare model with time can be used in resource planning and how Declare has been integrated into CPN Tools.

show abstract

“…These logics are therefore inadequate to quantitatively reason about timing properties of a system. On the other hand timed temporal logics such as Timed CTL (TCTL) [3] and Real Time CTL (RTCTL) [11] allow us to verify actual timing properties on a timed transition system. However, the verification of timed temporal logics has been found to be much more complex than their untimed counterparts [1].…”

Section: Introductionmentioning

confidence: 99%

“…For example, while LTL model checking is PSPACE complete, TLTL model checking is undecidable [4]. The problem is less severe in the case of branching time timed logics, where TCTL model checking is PSPACE complete [3,2] (where as CTL model checking is possible in polynomial time). It has been shown in [2] that TCTL model checking is PSPACE complete even in discrete-time models.…”

Section: Introductionmentioning

confidence: 99%

“…Interesting timing queries involving a combination of min and max can be expressed in Min-max CTL. While model checking using most timed temporal logics is PSPACE complete or harder [3,2], it is shown in [10] that many practical timing queries, where we are interested in the worst case or best case timings, can be answered in polynomial time by querying the system using Min-max CTL. In this paper the syntax of Min-max CTL is extended to increase the expressive power of Min-max CTL.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Reasoning about extremal properties of events

Deka

10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Log

View full text Add to dashboard Cite

This paper deals with a branching time temporal query language called Min-max CTL which is similar in syntax to the popular temporal logic, CTL [7]. Min-max CTL can express timing queries on a timed model, whereas CTL is used for untimed systems. Interesting timing queries involving a combination of min and max can be expressed in Min-max CTL. While model checking using most timed temporal logics is PSPACE complete or harder [3,2], it is shown in [10] that many practical timing queries, where we are interested in the worst case or best case timings, can be answered in polynomial time by querying the system using Min-max CTL. In this paper the syntax of Min-max CTL is extended to increase the expressive power of Min-max CTL.

show abstract

Real-Time Logics: Complexity and Expressiveness

Cited by 303 publications

References 32 publications

A Logical Characterisation of Event Clock Automata

A Logical Characterisation of Event Clock Automata

Using Timed Automata for a Priori Warnings and Planning for Timed Declarative Process Models

Reasoning about extremal properties of events

Contact Info

Product

Resources

About