Revisiting reachability in timed automata

Article Details
Title:	Revisiting reachability in timed automata
Article URLs:	https://doi.org/10.1109/LICS.2017.8005098 http://doi.ieeecomputersociety.org/10.1109/LICS.2017.8005098
Alternative Article URLs:
Authors:	Karin Quaas	Universität Leipzig
	Mahsa Shirmohammadi	University of Oxford
	James Worrell	University of Oxford
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:	https://arxiv.org/abs/1702.03450
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/lics/QuaasSW17
Author Comments:

ACM/IEEE Logic in Computer Science, LICS 2017