Timed games and deterministic separability
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1303059 (Why is no real title available?)
- scientific article; zbMATH DE number 1361127 (Why is no real title available?)
- scientific article; zbMATH DE number 2086417 (Why is no real title available?)
- scientific article; zbMATH DE number 7649924 (Why is no real title available?)
- A Note on Decidable Separability by Piecewise Testable Languages
- A theory of timed automata
- Analyzing timed systems using tree automata
- Better abstractions for timed automata
- CONCUR 2005 – Concurrency Theory
- Deciding piecewise testable separability for regular tree languages
- Effective definability of the reachability relation in timed automata
- Efficient separability of regular languages by subsequences and suffixes
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Fast algorithms for handling diagonal constraints in timed automata
- Folk theorems on the determinization and minimization of timed automata
- Foundations of Software Science and Computation Structures
- Foundations of Software Science and Computational Structures
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Invisible pushdown languages
- Minimum-Time Reachability in Timed Games
- Noncanonical Extensions of Bottom-Up Parsing Techniques
- On separation by locally testable and locally threshold testable languages
- On the Decidability of Grammar Problems
- On the synthesis of discrete controllers for timed systems
- Reachability in timed automata with diagonal constraints
- Reachability in two-clock timed automata is PSPACE-complete
- Reachability-Time Games on Timed Automata
- Regular Separability and Intersection Emptiness Are Independent Problems
- Regular separability of Parikh automata
- Regular separability of one counter automata
- Regular separability of well-structured transition systems
- Separability of reachability sets of vector addition systems
- Separating regular languages by piecewise testable and unambiguous languages
- Separating regular languages with first-order logic
- Solving Sequential Conditions by Finite-State Strategies
- The diagonal problem for higher-order recursion schemes is decidable
- The element of surprise in timed games.
- Time to learn -- learning timed automata from tests
- Unboundedness and downward closures of higher-order pushdown automata
- Undecidable Problems About Timed Automata
Cited in
(3)
This page was built for publication: Timed games and deterministic separability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842449)
