On Continuous Timed Automata with Input-Determined Guards

DOI10.1007/11944836_34MaRDI QIDQ5386000zbMATH OpenOpenAlexFDO

Authors Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar

Publication date 17 April 2008

Published in FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11944836_34

Mathematics Subject Classification ID

Temporal logic (03B44) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Counter-Free Input-Determined Timed Automata
• From \textsc{mtl} to deterministic timed automata
• A theory of timed automata
• Formal Modeling and Analysis of Timed Systems

Cited in

(8)

• Counter-Free Input-Determined Timed Automata
• From \textsc{mtl} to deterministic timed automata
• A survey of timed automata for the development of real-time systems
• scientific article; zbMATH DE number 1754581 (Why is no real title available?)
• Automata and logics over signals
• Formal analysis and control of timed automata with guards using (max, +) and (min, +) algebras
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Automata and logics over finitely varying functions

This page was built for publication: On Continuous Timed Automata with Input-Determined Guards

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