Timed automata and additive clock constraints

The subclass of linear hybrid automata which consists of time automata extended with additive clock constraints is investigated. A model is proved to be strictly more expressive than the basic one and the test for emptiness becomes undecidable. Results are extended to timed automata with only four c...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 2000-07, Vol.75 (1), p.1-7
Main Authors: Bérard, Béatrice, Dufourd, Catherine
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Automata. Abstract machines. Turing machines
Computer science
control theory
systems
Decidability of emptiness
Exact sciences and technology
Real-time systems
Theoretical computing
Timed automata
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The subclass of linear hybrid automata which consists of time automata extended with additive clock constraints is investigated. A model is proved to be strictly more expressive than the basic one and the test for emptiness becomes undecidable. Results are extended to timed automata with only four clocks and a restricted form of additive constraints.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(00)00075-2