Bounded variability of metric temporal logic
From MaRDI portal
Publication:2408743
DOI10.1007/s10472-016-9532-8zbMath1420.03032arXiv1306.2141WikidataQ57453362 ScholiaQ57453362MaRDI QIDQ2408743
Paola Spoletini, Carlo A. Furia
Publication date: 13 October 2017
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2141
03B70: Logic in computer science
03D05: Automata and formal grammars in connection with logical questions
03B25: Decidability of theories and sets of sentences
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03B44: Temporal logic
Related Items
Bounded variability of metric temporal logic, Extended Nested Dual System Groups, Revisited, Almost Event-Rate Independent Monitoring of Metric Temporal Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metric propositional neighborhood logic with an equivalence relation
- Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
- Continuous time temporal logic with counting
- Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
- The complexity of temporal logic over the reals
- Real-time logics: Complexity and expressiveness
- Modeling time in computing.
- Quantitative temporal logics over the reals: PSpace and below
- Complexity of metric temporal logics with counting and the Pnueli modalities
- Expressive completeness of duration calculus.
- The complexity of propositional linear temporal logics in simple cases
- Model-checking dense-time duration calculus
- The dark side of interval temporal logic: marking the undecidability border
- Bounded variability of metric temporal logic
- Metric temporal reasoning with less than two clocks
- Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals
- A theory of sampling for continuous-time metric temporal logic
- Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
- Time-Bounded Verification
- From MITL to Timed Automata
- Some Recent Results in Metric Temporal Logic
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
- MTL with Bounded Variability: Decidability and Complexity
- Towards a Theory of Time-Bounded Verification
- From Mtl to Deterministic Timed Automata
- The Complexity of Generalized Satisfiability for Linear Temporal Logic
- The complexity of propositional linear temporal logics
- Proving the Correctness of Multiprocess Programs
- A really temporal logic
- The benefits of relaxing punctuality
- Expressive Completeness for Metric Temporal Logic
- On the decidability and complexity of Metric Temporal Logic over finite words
- Checking Temporal Properties of Discrete, Timed and Continuous Behaviors
- Computability of Recursive Functions
- Formal Modeling and Analysis of Timed Systems
- Foundations of Software Science and Computation Structures
