Record Details

Updatable timed automata with additive and diagonal constraints

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Updatable timed automata with additive and diagonal constraints
 
Creator MANASA, L
KRISHNA, SN
NAGARAJ, K
 
Subject systems
 
Description 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 :similar to d-y. We show that these updates preserve the decidability of emptiness of classical timed automata with diagonal constraints for similar to is an element of {=, =, not equal}. 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].
 
Publisher SPRINGER-VERLAG BERLIN
 
Date 2011-10-23T23:34:06Z
2011-12-15T09:11:18Z
2011-10-23T23:34:06Z
2011-12-15T09:11:18Z
2008
 
Type Proceedings Paper
 
Identifier LOGIC AND THEORY OF ALGORITHMS,5028,407-416
978-3-540-69405-2
0302-9743
http://dx.doi.org/10.1007/978-3-540-69407-6_44
http://dspace.library.iitb.ac.in/xmlui/handle/10054/15268
http://hdl.handle.net/100/1988
 
Source 4th Conference on Computability in Europe (CiE 2008),Athens, GREECE,JUN 15-20, 2008
 
Language English