Updatable Timed Automata with Additive and Diagonal Constraints

Authors:
Lakshmi Manasa;Shankara Narayanan Krishna;Kumar Nagaraj
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, Powai, Mumbai, India 400 076;Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, Powai, Mumbai, India 400 076;Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, Powai, Mumbai, India 400 076
Venue:
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Year:
2008

Citing 9
Cited 0

A theory of timed automata

Theoretical Computer Science
Reachability analysis of dynamical systems having piecewise-constant derivatives

Theoretical Computer Science - Special issue on hybrid systems
The tool KRONOS

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Timed automata and additive clock constraints

Information Processing Letters
Automatic Symbolic Verification of Embedded Systems

IEEE Transactions on Software Engineering
Controlled Timed Automata

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On the Power of Non-Observable Actions in Timed Automata

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Updatable timed automata

Theoretical Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

Timed automata [1] are a well established theoretical framework used for modeling real time systems. In this paper, we introduce a class of timed automata with updates of the form x: ~d驴 y. We show that these updates preserve the decidability of emptiness of classical timed automata with diagonal constraints for ~ 驴 { = , , 驴 , 驴 }. When used along with additive constraints, these updates give decidable emptiness with 2 or lesser number of clocks, and become undecidable for 3 clocks. This provides a partial solution to a long standing open problem [5].