01130nas a2200205   4500000000100000000000100001008004100002260001200043653001100055653000800066653000800074100002300082700002100105245007600126856009800202300001000300490000600310520059400316022001400910       2015                            d  c12/201510aRTECTL10aSTS10aSMT1 aAgnieszka Zbrzezny1 aAndrzej Zbrzezny00aChecking RTECTL properties of STSs via SMT-based Bounded Model Checking  uhttp://www.ijimai.org/journal/sites/default/files/files/2015/11/ijimai20153_5_4_pdf_87485.pdf  a28-350 v33 aWe present an SMT-based bounded model checking (BMC) method for Simply-Timed Systems (STSs) and for the existential fragment of the Real-time Computation Tree Logic. We implemented the SMT-based BMC algorithm and compared it with the SAT-based BMC method for the same systems and the same property language on several benchmarks for STSs. For the SAT- based BMC we used the PicoSAT solver and for the SMT-based BMC we used the Z3 solver. The experimental results show that the SMT-based BMC performs quite well and is, in fact, sometimes significantly faster than the tested SAT-based BMC.  a1989-1660