A Logical Characterisation of Event Clock Automata

DOI10.1142/S0129054103001923zbMath1101.68647OpenAlexW2143622351MaRDI QIDQ5696929

Deepak D'Souza

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054103001923

zbMATH Keywords

timed automatatemporal logiclogic in computer scienceverification of real-time systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

A survey of timed automata for the development of real-time systems ⋮ Learning Meets Verification ⋮ Event clock message passing automata: a logical characterization and an emptiness checking algorithm ⋮ MSO logics for weighted timed automata ⋮ Event-Clock Visibly Pushdown Automata ⋮ Automata and Logics for Timed Message Sequence Charts

Cites Work

• Real-time logics: Complexity and expressiveness
• A theory of timed automata
• Weak Second‐Order Arithmetic and Finite Automata

This page was built for publication: A Logical Characterisation of Event Clock Automata