Including results for On Parametric One-Counter Automata.
Search only for On Parameterized One-Counter Automata.
More precisely, given a parametric timed automaton, a clock is said to be nonparametric if it is never compared with a parameter, and is parametric otherwise.
In this manuscript we establish a correspondence between reachability in parametric timed automata with at most two parametric clocks (and arbitrarily many ...
We show that reachability and repeated reachability in parameterized one-counter automata with unary updates are NP-complete. arxiv.org.
The reachability problem asks whether there are values for the parameters such that a final state can be reached from an initial state. Our second main result ...
Dec 13, 2015 · In this manuscript we establish a correspondence between reachability in parametric timed automata with at most two parametric clocks (and ...
May 3, 2020 · One-counter automata are obtained by extending classical finite-state automata with a counter whose value can range over non-negative integers ...
One-counter automata are obtained by extending classical finite-state automata with a counter whose value can range over non-negative integers and be tested ...
A POCA is a one-counter automaton whose counter updates are either integer values encoded in binary or integer-valued parameters. Given a formula and a ...
Missing: Parameterized | Show results with:Parameterized
Definition (Succinct OCA with Parameters). A = (Q,q0,T, δ,X) where δ : T → Op with Op the union of. ▷ CU := {+a : a ∈ Z}, CT := {= a,≥ a : a ∈ N}.
One-counter automata are obtained by extending classical finite-state automata with a counter whose value can range over non-negative integers and be tested for ...