Name
Abstract | ||
|---|---|---|
We study the reachability problem for continuous one-counter automata, COCA for short. In such automata, transitions are guarded by upper and lower bound tests against the counter value. Additionally, the counter updates associated with taking transitions can be (non-deterministically) scaled down by a nonzero factor between zero and one. Our three main results are as follows: (1) We prove that th... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/LICS52264.2021.9470525 | 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) |
DocType | ISBN | Citations |
Conference | 978-1-6654-4895-6 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Blondin | 1 | 27 | 9.06 |
| Tim Leys | 2 | 0 | 0.34 |
| Filip Mazowiecki | 3 | 0 | 0.34 |
| Philip Oftermatt | 4 | 0 | 0.34 |
| Guillermo A. Pérez | 5 | 0 | 0.34 |