@article{JAZIRI2014183,
    Abstract = {In this paper we develop the metatheory for Timed Modal Logic (TML), which is the modal logic used for the analysis of timed transition systems (TTSs). We solve a series of long-standing open problems related to TML. Firstly, we prove that TML enjoys the Hennessy-Milner property and solve one of the open questions in the field. Secondly, we prove that the set of validities are not recursively enumerable. Nevertheless, we develop a strongly-complete proof system for TML. Since the logic is not compact, the proof system contains infinitary rules, but only with countable sets of instances. Thus, we can involve topological results regarding Stone spaces, such as the Rasiowa-Sikorski lemma, to complete the proofs.},
    Author = {Jaziri, Samy and Larsen, Kim G. and Mardare, Radu and Xue, Bingtian},
    File = {Adequacy and Complete Axiomatization for Timed Modal Logic - 1-s2.0-S1571066114000784-main - a - v.pdf},
    ISSN = {1571-0661},
    Journal = {Electronic Notes in Theoretical Computer Science},
    Keywords = {Non-compact modal logics, complete axiomatization, timed modal logic},
    Note = {Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXX)},
    Pages = {183 - 210},
    Title = {Adequacy and Complete Axiomatization for Timed Modal Logic},
    URL = {http://www.sciencedirect.com/science/article/pii/S1571066114000784},
    Volume = {308},
    Year = {2014},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S1571066114000784},
    bdsk-url-2 = {https://doi.org/10.1016/j.entcs.2014.10.011},
    date-added = {2020-05-04 10:25:17 +0200},
    date-modified = {2020-05-04 10:25:17 +0200},
    file-2 = {Adequacy and Complete Axiomatization for Timed Modal Logic - xue - a - v.pdf},
    doi = {10.1016/j.entcs.2014.10.011}
}

@article{JAZIRI2014183, Abstract = {In this paper we develop the metatheory for Timed Modal Logic (TML), which is the modal logic used for the analysis of timed transition systems (TTSs). We solve a series of long-standing open problems related to TML. Firstly, we prove that TML enjoys the Hennessy-Milner property and solve one of the open questions in the field. Secondly, we prove that the set of validities are not recursively enumerable. Nevertheless, we develop a strongly-complete proof system for TML. Since the logic is not compact, the proof system contains infinitary rules, but only with countable sets of instances. Thus, we can involve topological results regarding Stone spaces, such as the Rasiowa-Sikorski lemma, to complete the proofs.}, Author = {Jaziri, Samy and Larsen, Kim G. and Mardare, Radu and Xue, Bingtian}, File = {Adequacy and Complete Axiomatization for Timed Modal Logic - 1-s2.0-S1571066114000784-main - a - v.pdf}, ISSN = {1571-0661}, Journal = {Electronic Notes in Theoretical Computer Science}, Keywords = {Non-compact modal logics, complete axiomatization, timed modal logic}, Note = {Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXX)}, Pages = {183 - 210}, Title = {Adequacy and Complete Axiomatization for Timed Modal Logic}, URL = {http://www.sciencedirect.com/science/article/pii/S1571066114000784}, Volume = {308}, Year = {2014}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S1571066114000784}, bdsk-url-2 = {https://doi.org/10.1016/j.entcs.2014.10.011}, date-added = {2020-05-04 10:25:17 +0200}, date-modified = {2020-05-04 10:25:17 +0200}, file-2 = {Adequacy and Complete Axiomatization for Timed Modal Logic - xue - a - v.pdf}, doi = {10.1016/j.entcs.2014.10.011} }