Parametrized Verification …
Parameterized systems consist of an arbitrary number of replicated agents with limited computational power, interacting to achieve common goals. They pervade computer science. Classical examples include families of digital circuits, distributed algorithms for leader election or byzantine agreement, routing algorithms, and multithreaded programs. Modern examples exhibit stochastic interaction between mobile agents, and include robot swarms, molecular computers, and cooperating ant colonies. A parameterized system is in fact an infinite collection of systems, one for each number of agents. Current verification technology of industrial strength can only check correctness of a few instances of this collection. For example, model checkers can automatically prove a distributed algorithm correct for a small number of processes, but not for any number.
While substantial progress has been made on the theory and applications of parameterized verification, in order to achieve large impact the field has to face three “grand challenges”:
- Develop novel algorithms and tools for parametrized verification of classical parameterized systems that bypass the high complexity of current techniques.
- Develop the first algorithms and tools for parameterized verification of modern stochastic parameterized systems.
- Develop the first algorithms and tools for synthesis of correct-by-construction parameterized systems.
PaVeS addresses these challenges applying constraint-based technology, and recent breakthroughs in the theory of Petri nets and Vector Addition Systems.