  We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear
Dynamic Logic (LDL) by temporal operators equipped with parameters that bound
their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL)
that is able to express all $\omega$-regular specifications while still
maintaining many of LTL's desirable properties like an intuitive syntax and a
translation into non-deterministic B\"uchi automata of exponential size. But
LDL lacks capabilities to express timing constraints. By adding parameterized
operators to LDL, we obtain a logic that is able to express all
$\omega$-regular properties and that subsumes parameterized extensions of LTL
like Parametric LTL and PROMPT-LTL. Our main technical contribution is a
translation of PLDL formulas into non-deterministic B\"uchi word automata of
exponential size via alternating automata. This yields a PSPACE model checking
algorithm and a realizability algorithm with doubly-exponential running time.
Furthermore, we give tight upper and lower bounds on optimal parameter values
for both problems. These results show that PLDL model checking and
realizability are not harder than LTL model checking and realizability.
