Generalizing the Discrete Timed Automaton

Authors:
Oscar H. Ibarra;Jianwen Su
Affiliations:
-;-
Venue:
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Year:
2000

Citing 7
Cited 0

Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Timed Automata and the Theory of Real Numbers

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Reachability Analysis for Some Models of Infinite-State Transition Systems

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures

Hybrid Systems II
Binary Reachability Analysis of Discrete Pushdown Timed Automata

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Debugging and verification of infinite state real-time systems

Debugging and verification of infinite state real-time systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with various data structures. We give examples of such data structures and exhibit some new properties of discrete timed automata that can be verified. We also briefly consider reachability in discrete timed automata operating in parallel.