Revisiting timed logics with automata modalities

DOI10.1145/3302504.3311818OpenAlexW2906142081WikidataQ130869999 ScholiaQ130869999MaRDI QIDQ5239221FDOQ5239221

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

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

zbMATH Keywords

model checkingtimed automatametric interval temporal logic

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)

Cited In (2)

• From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
• Integrated Formal Methods

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)