Specifying real-time properties with metric temporal logic
Real-Time Systems
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
On Communicating Finite-State Machines
Journal of the ACM (JACM)
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Automata-Theoretic Decision of Timed Games
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Better is Better than Well: On Efficient Verification of Infinite-State Systems
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
On the expressiveness of TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Realizability of Real-Time Logics
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
From MTL to deterministic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
| Hi-index | 0.00 |
We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL with timing constraints on modalities, and recently, its model-checking has been proved decidable in several cases. We investigate these decidable fragments of MTL (full MTL when interpreted over finite timed words, and Safety-MTL when interpreted over infinite timed words), and prove two kinds of results. (1) We first prove that, contrary to model-checking, the control problem is undecidable. Roughly, the computation of a lossy channel system could be encoded as a model-checking problem, and we prove here that a perfect channel system can be encoded as a control problem. (2) We then prove that if we fix the resources of the controller (by resources we mean clocks and constants that the controller can use), the control problem becomes decidable. This decidability result relies on properties of well (and better) quasi-orderings.