Research Article
A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems
Algorithm 1
Incremental bounded model checking algorithm.
Input: | PN: a Petri net model to describe the parameterized protocol | : an upward-closed set to describe the safety property | : base boundary | : maximum boundary | Output: | safe or unsafe | (1) initial assumption vector // push all active literals into assumption vector | (2) for do | (3) .push() | (4) end for | (5) // the initial boundary is | (6) inc-cut-off // create the incremental bounded Petri net | (7) inc-cut-off | (8) while do | (9) // use an SAT-based model checker to verify the property at the boundary | (10) if then | (11) print CEX | (12) RETURN | (13) else | (14) print “PN is safe for current boundary ” | (15) .pop() // the boundary is increased by 1 | (16) | (17) end if | (18) end while | (19) RETURN |
|