Decidability of Parameterized Verification

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 𝐌(n) parameterized by n ∈ ℕ, whether, for all n ∈ ℕ, the system 𝐌(n) satisfies a specification. In this book we consider the important case of 𝐌(n) being a concurrent system, where the number of replicated processes depends on the parameter n but each process is independent of n. Examples are cache coherence protocols, networks of finite-state agents, and systems that solve mutual exclusion or scheduling problems. Further examples are abstractions of systems, where the processes of the original systems actually depend on the parameter.