Opening book details…
Can I read Continuous One-counter Automata on EtoBox?
Continuous One-counter Automata by Michael Blondin; Tim Leys; Filip Mazowiecki; Philip Offtermatt; Guillermo Pérez is a Computer Science article available to read on EtoBox.
What is Continuous One-counter Automata about?
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: we prove (1) that the reachability problem for COCA with global upper- and lower-bound tests is in NC ^2^ ; (2) that, in general, the problem is decidable in polynomial time; and (3) that it is NP-complete for COCA with parametric counter updates and bound tests.
Who reads Continuous One-counter Automata?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Michael Blondin; Tim Leys; Filip Mazowiecki; Philip Offtermatt; Guillermo Pérez
- Publisher
- ACM
- Published
- 2023
- Language
- EN
- Field
- Computer Science (Physical Sciences)
More by Michael Blondin; Tim Leys; Filip Mazowiecki; Philip Offtermatt; Guillermo Pérez
Browse all works by Michael Blondin; Tim Leys; Filip Mazowiecki; Philip Offtermatt; Guillermo Pérez