Revisiting timed logics with automata modalities

DOI10.1145/3302504.3311818MaRDI QIDQ5239221zbMATH OpenOpenAlexWikidataFDO

Authors Hsi-Ming Ho

Publication date 22 October 2019

Published in Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.10146, http://shura.shu.ac.uk/25238/1/Ho%20Revisiting%20Timed%20Logics%20with%20Automata%20Modalities.pdf

zbMATH Keywords

metric interval temporal logicmodel checkingtimed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Recommendations

• CONCUR 2005 – Concurrency Theory
• A logical characterization of timed (non-)regular languages
• A logical characterization of timed regular languages
• Making Metric Temporal Logic Rational
• On Expressiveness and Complexity in Real-Time Model Checking

Cited in

(7)

• Context-free timed formalisms: robust automata and linear temporal logics
• Integrated Formal Methods
• From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
• When do you start counting? Revisiting counting and Pnueli modalities in timed logics
• Satisfiability checking of multi-variable TPTL with unilateral intervals is PSPACE-complete
• Metric quantifiers and counting in timed logics and automata
• Expressive equivalence between decidable freeze and metric timed temporal logics.

This page was built for publication: Revisiting timed logics with automata modalities

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