Explore how to verify compact parallel programs using a geometric model and a practical algorithm.
This book introduces a reachability framework built around controlled vector addition systems (CVAS) and a method called DEVELOP to generate observable representations of reachable states. It shows how the structure of CVAS connects to parallel coordination programs and explains conditions under which the analysis terminates or remains finite.
- Learn the core idea of a reachability set description (RSD) and how it describes which states a program can reach.
- See how the DEVELOP algorithm builds RSDs for a class of CVAS and why compactness and normality matter.
- Understand parametric analysis for families of CVAS and what it means for termination and representative values.
- Discover how concepts like restricted, conservative CVAS and regions help manage complexity in verification.
Ideal for readers of formal verification, parallel programming, and verification of coordination systems who want a concrete modeling approach and a practical verification method.