Timed Temporal Logics

Bouyer, Patricia; Laroussinie, François; Markey, Nicolas; Ouaknine, Joël; Worrell, James

doi:10.1007/978-3-319-63121-9_11

Cited by 11 publications

(8 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These aspects influence the applicability of the logic [14] and impact decidability (a complete overview is beyond the scope of this paper, cf. [3,6,19,52,75,77] but also see our discussion at the end of Subsect. 7.2).…”

Section: Related Workmentioning

confidence: 79%

“…This leads to an undesirable accumulation of variables since typical attribute modifications (such as increasing an attribute by one) are therefore implemented by adding a fresh variable that is then connected to a given attribute disconnecting the former variable. 19 Lastly, the requirement R 4 is not satisfied since the AC used in transformation rules is by the pushout construction simply added as a constraint to the AC of the resulting graph but no single value is selected. 20 The subsequently introduced notion of attributed graph transformation satisfies the requirements R 1 -R 5 from above suitably employing global variables.…”

Section: Graph Transformationmentioning

confidence: 99%

“…Note that many other metric temporal logics already impose the restriction that sets of timepoints must be specified by means of certain kinds of intervals. These logics thereby describe already on the syntax-level restrictions under which model checking of their conditions is decidable (see [19] for a survey on the expressiveness and algorithmic results for several metric temporal logics).…”

Section: Syntax and Semantics Of Mtglmentioning

confidence: 99%

See 2 more Smart Citations

Formal testing of timed graph transformation systems using metric temporal graph logic

Schneider

Maximova

Sakizloglou

et al. 2021

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Embedded real-time systems generate state sequences where time elapses between state changes. Ensuring that such systems adhere to a provided specification of admissible or desired behavior is essential. Formal model-based testing is often a suitable cost-effective approach. We introduce an extended version of the formalism of symbolic graphs, which encompasses types as well as attributes, for representing states of dynamic systems. Relying on this extension of symbolic graphs, we present a novel formalism of timed graph transformation systems (TGTSs) that supports the model-based development of dynamic real-time systems at an abstract level where possible state changes and delays are specified by graph transformation rules. We then introduce an extended form of the metric temporal graph logic (MTGL) with increased expressiveness to improve the applicability of MTGL for the specification of timed graph sequences generated by a TGTS. Based on the metric temporal operators of MTGL and its built-in graph binding mechanics, we express properties on the structure and attributes of graphs as well as on the occurrence of graphs over time that are related by their inner structure. We provide formal support for checking whether a single generated timed graph sequence adheres to a provided MTGL specification. Relying on this logical foundation, we develop a testing framework for TGTSs that are specified using MTGL. Lastly, we apply this testing framework to a running example by using our prototypical implementation in the tool AutoGraph.

show abstract

Section: Related Workmentioning

confidence: 79%

Section: Graph Transformationmentioning

confidence: 99%

Section: Syntax and Semantics Of Mtglmentioning

confidence: 99%

See 1 more Smart Citation

Formal testing of timed graph transformation systems using metric temporal graph logic

Schneider

Maximova

Sakizloglou

et al. 2021

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

show abstract

“…Uppaal [15], the reference tool for timed systems verification, supports only bounded variable types and therefore finite asynchronous TTS. Properties are limited to a subset of the branching-time logic TCTL [16,17]. LTSmin [18] and Divine [19] are two model checkers that support the Uppaal specification language and properties specified in LTL.…”

Section: Related Workmentioning

confidence: 99%

Extending nuXmv with Timed Transition Systems and Timed Temporal Properties

Cimatti

Griggio

Magnago

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

NUXMV is a well-known symbolic model checker, which implements various state-of-the-art algorithms for the analysis of finite-and infinite-state transition systems and temporal logics. In this paper, we present a new version that supports timed systems and logics over continuous super-dense semantics. The system specification was extended with clocks to constrain the timed evolution. The support for temporal properties has been expanded to include MTL0,∞ formulas with parametric intervals. The analysis is performed via a reduction to verification problems in the discrete-time case. The internal representation of traces has been extended to go beyond the lasso-shaped form, to take into account the possible divergence of clocks. We evaluated the new features by comparing NUXMV with other verification tools for timed automata and MTL0,∞, considering different benchmarks from the literature. The results show that NUXMV is competitive with and in many cases performs better than state-of-the-art tools, especially on validity problems for MTL0,∞.

show abstract

“…Ultimately, however, we are interested in complex tasks over predefined time horizons ("collect data in region C every 50 seconds and upload it in region D after at most 10 seconds"), which can be encompassed by timed temporal languages (e.g., Metric Temporal Logic) [14]. Timed temporal tasks have been considered in a variety of works in the related literature [12], [15]- [23].…”

Section: Introductionmentioning

confidence: 99%

Reconfigurable Motion Planning and Control in Obstacle Cluttered Environments under Timed Temporal Tasks

Verginis

Vrohidis

Bechlioulis

et al. 2019

2019 International Conference on Robotics and Automation (ICRA)

View full text Add to dashboard Cite

This work addresses the problem of robot navigation under timed temporal specifications in workspaces cluttered with obstacles. We propose a hybrid control strategy that guarantees the accomplishment of a high-level specification expressed as a timed temporal logic formula, while preserving safety (i.e., obstacle avoidance) of the system. In particular, we utilize a motion controller that achieves safe navigation inside the workspace in predetermined time, thus allowing us to abstract the motion of the agent as a finite timed transition system among certain regions of interest. Next, we employ standard formal verification and convex optimization techniques to derive high-level timed plans that satisfy the agent's specifications. A simulation study illustrates and clarifies the proposed scheme.

show abstract

Timed Temporal Logics

Cited by 11 publications

References 48 publications

Formal testing of timed graph transformation systems using metric temporal graph logic

Formal testing of timed graph transformation systems using metric temporal graph logic

Extending nuXmv with Timed Transition Systems and Timed Temporal Properties

Reconfigurable Motion Planning and Control in Obstacle Cluttered Environments under Timed Temporal Tasks

Contact Info

Product

Resources

About