@inproceedings{10.1007/978-3-030-81685-8_30,
    Abstract = {Given the versatility of timed automata a huge body of work has evolved that considers extensions of timed automata. One extension that has received a lot of interest is timed automata with a, possibly unbounded, stack, also called pushdown timed automata (PDTA). While different algorithms have been given for reachability in different variants of this model, most of these results are purely theoretical and do not give rise to efficient implementations. One main reason for this is that none of these algorithms (and the implementations that exist) use the so-called zone-based abstraction, but rely either on the region-abstraction or other approaches, which are significantly harder to implement.},
    Address = {Cham},
    Author = {Akshay, S. and Gastin, Paul and Prakash, Karthik R.},
    BookTitle = {Computer Aided Verification},
    Editor = {Silva, Alexandra and Leino, K. Rustan M.},
    File = {Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata - 978-3-030-81685-8\_30.pdf},
    ISBN = {978-3-030-81685-8},
    Pages = {619--642},
    Publisher = {Springer International Publishing},
    Title = {Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata},
    Year = {2021},
    date-added = {2023-05-26 14:05:10 +0200},
    date-modified = {2023-05-26 14:05:10 +0200},
    doi = {10.1007/978-3-030-81685-8_30}
}

@inproceedings{10.1007/978-3-030-81685-8_30, Abstract = {Given the versatility of timed automata a huge body of work has evolved that considers extensions of timed automata. One extension that has received a lot of interest is timed automata with a, possibly unbounded, stack, also called pushdown timed automata (PDTA). While different algorithms have been given for reachability in different variants of this model, most of these results are purely theoretical and do not give rise to efficient implementations. One main reason for this is that none of these algorithms (and the implementations that exist) use the so-called zone-based abstraction, but rely either on the region-abstraction or other approaches, which are significantly harder to implement.}, Address = {Cham}, Author = {Akshay, S. and Gastin, Paul and Prakash, Karthik R.}, BookTitle = {Computer Aided Verification}, Editor = {Silva, Alexandra and Leino, K. Rustan M.}, File = {Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata - 978-3-030-81685-8_30.pdf}, ISBN = {978-3-030-81685-8}, Pages = {619--642}, Publisher = {Springer International Publishing}, Title = {Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata}, Year = {2021}, date-added = {2023-05-26 14:05:10 +0200}, date-modified = {2023-05-26 14:05:10 +0200}, doi = {10.1007/978-3-030-81685-8_30} }