LTL with the freeze quantifier and register automata
A data word is a sequence of pairs of a letter from a finite alphabet and an element from an
infinite set, where the latter can only be compared for equality. To reason about data words …
infinite set, where the latter can only be compared for equality. To reason about data words …
Model checking real-time systems
This chapter surveys timed automata as a formalism for model checking real-time systems.
We begin with introducing the model, as an extension of finite-state automata with real …
We begin with introducing the model, as an extension of finite-state automata with real …
Complexity hierarchies beyond elementary
S Schmitz - ACM Transactions on Computation Theory (TOCT), 2016 - dl.acm.org
We introduce a hierarchy of fast-growing complexity classes and show its suitability for
completeness statements of many nonelementary problems. This hierarchy allows the …
completeness statements of many nonelementary problems. This hierarchy allows the …
Some recent results in metric temporal logic
J Ouaknine, J Worrell - International Conference on Formal Modeling and …, 2008 - Springer
Abstract Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear
Temporal Logic. In this paper we survey results about the complexity of the satisfiability and …
Temporal Logic. In this paper we survey results about the complexity of the satisfiability and …
On the decidability and complexity of metric temporal logic over finite words
J Ouaknine, J Worrell - Logical Methods in Computer Science, 2007 - lmcs.episciences.org
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In
this paper, we show that the satisfiability problem for MTL over finite timed words is …
this paper, we show that the satisfiability problem for MTL over finite timed words is …
Model-checking timed temporal logics
P Bouyer - Electronic notes in theoretical computer science, 2009 - Elsevier
Model-checking Timed Temporal Logics Page 1 Model-checking Timed Temporal Logics
Patricia Bouyer1,2 LSV, CNRS & ENS Cachan, France Oxford University Computing …
Patricia Bouyer1,2 LSV, CNRS & ENS Cachan, France Oxford University Computing …
Timed temporal logics
Since the early 1990's, classical temporal logics have been extended with timing constraints.
While temporal logics only express contraints on the order of events, their timed extensions …
While temporal logics only express contraints on the order of events, their timed extensions …
Safety metric temporal logic is fully decidable
J Ouaknine, J Worrell - International conference on tools and algorithms for …, 2006 - Springer
Abstract Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear
Temporal Logic. In this paper we consider a fragment of MTL, called Safety MTL, capable of …
Temporal Logic. In this paper we consider a fragment of MTL, called Safety MTL, capable of …
Alternation-free modal mu-calculus for data trees
M Jurdzinski, R Lazic - 22nd Annual IEEE Symposium on Logic …, 2007 - ieeexplore.ieee.org
An alternation-free modal ì-calculus over data trees is introduced and studied. A data tree is
an unranked ordered tree whose every node is labelled by a letter from a finite alphabet and …
an unranked ordered tree whose every node is labelled by a letter from a finite alphabet and …
Runtime verification of temporal properties over out-of-order data streams
We present a monitoring approach for verifying systems at runtime. Our approach targets
systems whose components communicate with the monitors over unreliable channels …
systems whose components communicate with the monitors over unreliable channels …