Universality analysis for one-clock timed automata

MaRDI QIDQ3601411zbMATH OpenFDO

Authors Johann Deneux, Joël Ouaknine, Karin Quaas, Parosh A. Abdulla, James Worrell

Publication date 10 February 2009

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Zone-Based Universality Analysis for Single-Clock Timed Automata
• Alternating timed automata
• Automata, Languages and Programming
• Undecidability of Universality for Timed Automata with Minimal Resources
• scientific article; zbMATH DE number 1956642

Cited in

(16)

• Timed hyperproperties
• Alternating timed automata
• Undecidability of Universality for Timed Automata with Minimal Resources
• Timed Petri nets with reset for pipelined synchronous circuit design
• The compound interest in relaxing punctuality
• Zone-Based Universality Analysis for Single-Clock Timed Automata
• Classes of timed automata and the undecidability of universality
• Exact Incremental Analysis of Timed Automata with an SMT-Solver
• Automata, Languages and Programming
• Sampled Universality of Timed Automata
• Equivalence checking and intersection of deterministic timed finite state machines
• scientific article; zbMATH DE number 1956642 (Why is no real title available?)
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• On parametric timed automata and one-counter machines
• Foundations of Software Science and Computational Structures
• Design and verification of pipelined circuits with timed Petri nets

Describes a project that uses

Uses Software

• Kronos

This page was built for publication: Universality analysis for one-clock timed automata

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