Analyzing Timed Systems Using Tree Automata
From MaRDI portal
Recommendations
- Analyzing timed systems using tree automata
- Towards an Efficient Tree Automata based technique for Timed Systems
- Timed tree automata with an application to temporal logic.
- Timed alternating tree automata: The automata-theoretic solution to the TCTL model checking problem
- A theory of timed automata
- Timed automata: Semantics, algorithms and tools
- scientific article; zbMATH DE number 1543316
- Branching-time temporal logic and tree automata
- Timed automata robustness analysis via model checking
- Timed automata
Cited in
(11)- On exteriority notions in book embeddings and treewidth
- Analysis of scheduling behaviour using generic timed automata
- A model of finite automata on timed omega-trees
- Exact Incremental Analysis of Timed Automata with an SMT-Solver
- Analyzing timed systems using tree automata
- scientific article; zbMATH DE number 744061 (Why is no real title available?)
- Timed alternating tree automata: The automata-theoretic solution to the TCTL model checking problem
- Bounded context switching for valence systems
- Verifying quantitative temporal properties of procedural programs
- Data multi-pushdown automata
- Towards an Efficient Tree Automata based technique for Timed Systems
This page was built for publication: Analyzing Timed Systems Using Tree Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608679)