Conference item icon

Conference item

Revisiting reachability in timed automata

Abstract:

We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear arithmetic over the integers and reals. In this paper we give a new and simpler proof of this result, building on the well-known reachability analysis of timed automata involving difference bound matrices. Using this new proof, we give an exponential-space procedure for model checking the reachability fragment of the l...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1109/LICS.2017.8005098

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Green Templeton College
Role:
Author
Publisher:
Institute of Electrical and Electronics Engineers Publisher's website
Journal:
Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) Journal website
Host title:
Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017)
Publication date:
2017-08-18
Acceptance date:
2017-03-21
DOI:
ISSN:
1043-6871
Source identifiers:
681755
Keywords:
Pubs id:
pubs:681755
UUID:
uuid:c761bf36-6ced-4ffa-91b7-a4bc146c4c97
Local pid:
pubs:681755
Deposit date:
2018-09-05

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP