Pushdown timed automata: A binary reachability characterization and safety verification.
From MaRDI portal
Publication:1401320
Recommendations
Cites work
- scientific article; zbMATH DE number 1670482 (Why is no real title available?)
- scientific article; zbMATH DE number 1670555 (Why is no real title available?)
- scientific article; zbMATH DE number 1670769 (Why is no real title available?)
- scientific article; zbMATH DE number 1689043 (Why is no real title available?)
- scientific article; zbMATH DE number 1223712 (Why is no real title available?)
- scientific article; zbMATH DE number 1232241 (Why is no real title available?)
- scientific article; zbMATH DE number 1361127 (Why is no real title available?)
- scientific article; zbMATH DE number 1796143 (Why is no real title available?)
- scientific article; zbMATH DE number 1796156 (Why is no real title available?)
- scientific article; zbMATH DE number 1796157 (Why is no real title available?)
- scientific article; zbMATH DE number 1798172 (Why is no real title available?)
- scientific article; zbMATH DE number 2102690 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A really temporal logic
- A theory of timed automata
- ASTRAL
- From timed automata to logic -- and back
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Model-checking in dense real-time
- New Decidability Results Concerning Two-Way Counter Machines
- Reachability analysis of pushdown automata: Application to model-checking
- Real-time logics: Complexity and expressiveness
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Symbolic model checking for real-time systems
- The benefits of relaxing punctuality
- The complexity of decision problems for finite-turn multicounter machines
- Uppaal in a nutshell
Cited in
(27)- Reachability relations of timed pushdown automata
- Logics for weighted timed pushdown automata
- Execution information rate for some classes of automata
- A survey of timed automata for the development of real-time systems
- Quantifying communication in synchronized languages
- Security of numerical sensors in automata
- Fast zone-based algorithms for reachability in pushdown timed automata
- Eliminating the storage tape in reachability constructions.
- Quantifying communication in synchronized languages
- Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
- Lossiness of communication channels modeled by transducers1
- On composition and lookahead delegation of \(e\)-services modeled by automata
- A logical characterization of timed pushdown languages
- Reachability results for timed automata with unbounded data structures
- Similarity in languages and programs
- Verification for timed automata extended with unbounded discrete data structures
- Effective definability of the reachability relation in timed automata
- scientific article; zbMATH DE number 1949647 (Why is no real title available?)
- Past pushdown timed automata and safety verification.
- scientific article; zbMATH DE number 2080995 (Why is no real title available?)
- Dense-choice counter machines revisited
- scientific article; zbMATH DE number 1796157 (Why is no real title available?)
- Linear reachability problems and minimal solutions to linear Diophantine equation systems
- Sampling automata and programs
- Timed recursive state machines: expressiveness and complexity
- Information rate of some classes of non-regular languages: an automata-theoretic approach
- scientific article; zbMATH DE number 1670769 (Why is no real title available?)
This page was built for publication: Pushdown timed automata: A binary reachability characterization and safety verification.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401320)
