Timed Automata with Integer Resets: Language Inclusion and Expressiveness
From MaRDI portal
Recommendations
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
- Adding dense-timed stack to integer reset timed automata
- Decidability and complexity results for timed automata via channel machines
- A theory of timed automata
- Universality and language inclusion for open and closed timed automata
Cites work
- A theory of timed automata
- Event-clock automata: a determinizable class of timed automata
- Folk theorems on the determinization and minimization of timed automata
- Formal Methods for the Design of Real-Time Systems
- scientific article; zbMATH DE number 1337733 (Why is no real title available?)
- scientific article; zbMATH DE number 1530301 (Why is no real title available?)
- Modeling and verification of a fault-tolerant real-time startup protocol using calendar automata
- On timed automata with input-determined guards
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness
- Timed vs. time-triggered automata
- Undecidability Results for Timed Automata with Silent Transitions
- Undecidable Problems About Timed Automata
Cited in
(18)- Adding dense-timed stack to integer reset timed automata
- A game approach to determinize timed automata
- Incremental Language Inclusion Checking for Networks of Timed Automata
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
- A survey of timed automata for the development of real-time systems
- Universality and language inclusion for open and closed timed automata
- scientific article; zbMATH DE number 7559498 (Why is no real title available?)
- Determinisability of register and timed automata
- scientific article; zbMATH DE number 7156375 (Why is no real title available?)
- Model checking weighted integer reset timed automata
- Developments in Language Theory
- An introduction to timed automata
- Timed bounded verification of inclusion based on timed bounded discretized language
- Control strategies for off-line testing of timed systems
- New insights into opacity verification in timed discrete-event systems
- A Myhill-Nerode style characterization for timed automata with integer resets
- Observer design and opacity verification for a class of timed automata
This page was built for publication: Timed Automata with Integer Resets: Language Inclusion and Expressiveness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543291)