@article{10.1145/3559736.3559738,
    Abstract = {Given a timed automaton A and a control state q, does there exist a run of A that visits q? This problem of control state reachability in timed automata was posed in [Alur and Dill 1994] and is known to be PSPACE-complete. One does not hope to have efficient algorithms for this problem, in theory. Nevertheless, research in this subject over the last three decades has led to industry-strength award-winning tools implementing this problem. This topic continues to be an active area of research even now. In this article, we present one successful algorithmic framework for attacking this problem.},
    Address = {New York, NY, USA},
    Author = {Srivathsan, B},
    Journal = {ACM SIGLOG News},
    Month = {aug},
    Number = {3},
    Pages = {6--28},
    Publisher = {Association for Computing Machinery},
    Title = {Reachability in Timed Automata},
    URL = {https://doi.org/10.1145/3559736.3559738},
    Volume = {9},
    Year = {2022},
    bdsk-url-1 = {https://doi.org/10.1145/3559736.3559738},
    date-added = {2022-08-30 14:49:01 +0200},
    date-modified = {2022-08-30 14:49:01 +0200},
    issue_date = {July 2022},
    numpages = {23},
    doi = {10.1145/3559736.3559738}
}

@article{10.1145/3559736.3559738, Abstract = {Given a timed automaton A and a control state q, does there exist a run of A that visits q? This problem of control state reachability in timed automata was posed in [Alur and Dill 1994] and is known to be PSPACE-complete. One does not hope to have efficient algorithms for this problem, in theory. Nevertheless, research in this subject over the last three decades has led to industry-strength award-winning tools implementing this problem. This topic continues to be an active area of research even now. In this article, we present one successful algorithmic framework for attacking this problem.}, Address = {New York, NY, USA}, Author = {Srivathsan, B}, Journal = {ACM SIGLOG News}, Month = {aug}, Number = {3}, Pages = {6--28}, Publisher = {Association for Computing Machinery}, Title = {Reachability in Timed Automata}, URL = {https://doi.org/10.1145/3559736.3559738}, Volume = {9}, Year = {2022}, bdsk-url-1 = {https://doi.org/10.1145/3559736.3559738}, date-added = {2022-08-30 14:49:01 +0200}, date-modified = {2022-08-30 14:49:01 +0200}, issue_date = {July 2022}, numpages = {23}, doi = {10.1145/3559736.3559738} }