A logical characterization of timed regular languages

DOI10.1016/j.tcs.2016.07.020zbMath1355.68150OpenAlexW2504709358MaRDI QIDQ728264

Marcello M. Bersani, Pierluigi San Pietro, Matteo Rossi

Publication date: 19 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.020

zbMATH Keywords

timed automataconstraint linear temporal logicdense-time temporal logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Temporal logic (03B44)

Related Items (2)

On the initialization of clocks in timed formalisms ⋮ Using formal verification to evaluate the execution time of Spark applications

Uses Software

• z3
• GitHub

Cites Work

• Unnamed Item
• A tool for deciding the satisfiability of continuous-time metric temporal logic
• Constraint LTL satisfiability checking without automata
• An automata-theoretic approach to constraint LTL
• An SMT-based approach to satisfiability checking of MITL
• A theory of timed automata
• A Logical Characterization of Timed (non-)Regular Languages
• On Expressiveness and Complexity in Real-Time Model Checking
• Constraint logic programming for reasoning about discrete event processes
• A really temporal logic
• The benefits of relaxing punctuality
• Deciding Continuous-Time Metric Temporal Logic with Counting Modalities
• A Proof of Kamp's theorem
• On MITL and Alternating Timed Automata over Infinite Words
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: A logical characterization of timed regular languages