Kripke structure
What is (pseudocode) an algorithm for checking the invariant over Kripke structures, so that in case of violation of the invariant, the counter example returned by the algorithm has a minimum length?
+3
Rinad Rama
source
to share
1 answer
You haven't provided enough details in the question, but if I had to guess I would say you are looking for Breadth First Search .
+2
Andrej Bauer
source
to share