loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th Annual IEEE Symposium on Logic in Computer Science (LICS'02)
Computing Reachability Relations in Timed Automata
Copenhagen, Denmark
July 22-July 25
ISBN: 0-7695-1483-9
ASCII Text
x 
 
Cătălin Dima, "Computing Reachability Relations in Timed Automata," Logic in Computer Science, Symposium on, pp. 177, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2002.1029827,
author = {Cătălin Dima},
title = {Computing Reachability Relations in Timed Automata},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2002},
issn = {1043-6871},
pages = {177},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2002.1029827},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Computing Reachability Relations in Timed Automata
SN - 1043-6871
SP
EP
A1 - Cătălin Dima,
PY - 2002
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Cătălin Dima, Verimag
We give an algorithmic calculus of the reachability relations on clock values defined by timed automata. Our approach is a modular one, by computing unions, compositions and reflexive-transitive closure (star) of "atomic" relations. The essential tool is a new representation technique for n-clock relations — the 2n-automata — and our strategy is to show the closure under union, composition and star of the class of 2n-automata that represent reachability relations in timed automata.
Citation:
Cătălin Dima, "Computing Reachability Relations in Timed Automata," lics, pp.177, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.