Decidability of Parameterized Verification (Synthesis Lectures on Distributed Computing Theory)

While the classic model checking problem is to decide whether a finite system satisfies a specification, the goal of parameterized model checking is to decide, given finite systems