scientific article; zbMATH DE number 1956642
From MaRDI portal
Publication:4418006
Recommendations
- Classes of timed automata and the undecidability of universality
- Classes of timed automata and the undecidability of universality
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness
- Universality analysis for one-clock timed automata
- Sampled Universality of Timed Automata
- Language emptiness of continuous-time parametric timed automata
- Unambiguity in Timed Regular Languages: Automata and Logics
- A Machine-Independent Characterization of Timed Languages
- A theory of ultimately periodic languages and automata with an application to time granularity
Cited in
(18)- Network invariants for real-time systems
- Detectability of labeled weighted automata over monoids
- On the distance between timed automata
- Classes of timed automata and the undecidability of universality
- Incremental Language Inclusion Checking for Networks of Timed Automata
- Model-based verification, optimization, synthesis and performance evaluation of real-time systems
- Time-Bounded Verification
- Zone-Based Universality Analysis for Single-Clock Timed Automata
- Undecidability of Universality for Timed Automata with Minimal Resources
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness
- Unambiguity in Timed Regular Languages: Automata and Logics
- Universality analysis for one-clock timed automata
- On parametric timed automata and one-counter machines
- Classes of timed automata and the undecidability of universality
- Automata, Languages and Programming
- Timed bounded verification of inclusion based on timed bounded discretized language
- Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete
- Reachability in two-parametric timed automata with one parameter is expspace-complete
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418006)
