Parameterized Verification of Linear Networks using Automata as Invariants
Aravinda Prasad Sistla, Viktor Gyuris · Formal Aspects of Computing · 1999
Abstract. The paper proposes an induction based approach, that employs automata as inductive invariants, for verifying safety and liveness properties of linear networks of arbitrary size. The proposed method has been shown to be complete for verifying safety properties. Automated methods that check for correcteness of such families of networks are proposed. These methods are based on generating an invariant automaton from the correctness property which is also specified by an automaton. These methods have been implemented and successfully tested on some examples.