On the initialization of clocks in timed formalisms

DOI10.1016/j.tcs.2019.11.023zbMath1433.03048OpenAlexW2990466717WikidataQ126757065 ScholiaQ126757065MaRDI QIDQ1989329

Pierluigi San Pietro, Matteo Rossi, Marcello M. Bersani

Publication date: 21 April 2020

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

Full work available at URL: http://hdl.handle.net/11311/1120518

zbMATH Keywords

timed automatasatisfiabilitylanguage equivalenceformal languagesmetric temporal logictimed regular languagesZenoness

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)

Uses Software

• z3

Cites Work

• A tool for deciding the satisfiability of continuous-time metric temporal logic
• Constraint LTL satisfiability checking without automata
• A logical characterization of timed regular languages
• An automata-theoretic approach to constraint LTL
• An SMT-based approach to satisfiability checking of MITL
• A theory of timed automata
• Updatable timed automata
• A Logical Characterization of Timed (non-)Regular Languages
• Unnamed Item

This page was built for publication: On the initialization of clocks in timed formalisms