@inbook {spin2018,
	title = {Lazy Reachability Checking for Timed Automata with Discrete Variables},
	booktitle = {Model Checking Software, SPIN 2018},
	series = {Lecture Notes in Computer Science},
	volume = {10869},
	year = {2018},
	pages = {235-254},
	publisher = {Springer},
	organization = {Springer},
	abstract = {<p>
	Systems and software with time dependent behavior are often formally specified using timed automata. For practical real-time systems, these specifications typically contain discrete data variables with nontrivial data flow besides real-valued clock variables. In this paper, we propose a lazy abstraction method for the location reachability problem of timed automata that can be used to efficiently control the visibility of discrete variables occurring in such specifications, this way alleviating state space explosion. The proposed abstraction refinement strategy is based on interpolation for variable assignments and symbolic backward search. We combine in a single algorithm our abstraction method with known efficient lazy abstraction algorithms for the handling of clock variables. Our experiments show that the proposed method performs favorably when compared to other lazy methods, and is suitable to significantly reduce the number of states generated during state space exploration.</p>
},
	doi = {10.1007/978-3-319-94111-0_14},
	author = {Tam{\'a}s T{\'o}th and Istv{\'a}n Majzik},
	editor = {Gallardo, Mar{\'\i}a del Mar and Pedro Merino}
}
