A logical characterization of timed regular languages

DOI10.1016/J.TCS.2016.07.020zbMATH Open1355.68150OpenAlexW2504709358MaRDI QIDQ728264FDOQ728264

Authors: Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro 

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

Recommendations

• A logical characterization of timed (non-)regular languages
• On the initialization of clocks in timed formalisms
• A tool for deciding the satisfiability of continuous-time metric temporal logic
• scientific article; zbMATH DE number 7056237
• Making Metric Temporal Logic Rational

zbMATH Keywords

timed automataconstraint linear temporal logicdense-time temporal logic

Mathematics Subject Classification ID

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

Cites Work

• A tool for deciding the satisfiability of continuous-time metric temporal logic
• A theory of timed automata
• A logical characterization of timed (non-)regular languages
• On Expressiveness and Complexity in Real-Time Model Checking
• A really temporal logic
• The benefits of relaxing punctuality
• Constraint LTL satisfiability checking without automata
• Deciding continuous-time metric temporal logic with counting modalities
• A Proof of Kamp's theorem
• An automata-theoretic approach to constraint LTL
• An SMT-based approach to satisfiability checking of MITL
• Tools and Algorithms for the Construction and Analysis of Systems
• Title not available (Why is that?)
• Constraint logic programming for reasoning about discrete event processes
• On MITL and alternating timed automata over infinite words

Cited In (14)

• On the initialization of clocks in timed formalisms
• A Machine-Independent Characterization of Timed Languages
• Two size measures for timed languages
• Foundations of Software Science and Computation Structures
• A logical characterization of timed (non-)regular languages
• LOGSPACE and PTIME characterized by programming languages
• Unambiguity in Timed Regular Languages: Automata and Logics
• An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
• A tool for deciding the satisfiability of continuous-time metric temporal logic
• Using formal verification to evaluate the execution time of Spark applications
• Title not available (Why is that?)
• Generating Functions of Timed Languages
• Developments in Language Theory
• Active learning of deterministic timed automata with Myhill-Nerode style characterization

Uses Software

• z3
• GitHub

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q728264)