Universality analysis for one-clock timed automata

zbMATH Open1154.68063MaRDI QIDQ3601411FDOQ3601411

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

Publication date: 10 February 2009

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (16)

• Timed hyperproperties
• 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
• Automata, Languages and Programming
• Exact Incremental Analysis of Timed Automata with an SMT-Solver
• Sampled Universality of Timed Automata
• Equivalence checking and intersection of deterministic timed finite state machines
• Title not available (Why is that?)
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Foundations of Software Science and Computational Structures
• Design and verification of pipelined circuits with timed Petri nets
• On parametric timed automata and one-counter machines
• Alternating timed automata

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)