A safety check returns a counterexample trace. What does the trace establish?
What must a completed finite-state model check cover?
The product of component state counts bounds possible global combinations, but fewer combinations may be reachable.
Circle one: True False
A lock model records (a,b), with A's bit first and B's second. A bit of 1 means holding. The trace is (0,0) -> (0,1) -> (1,1). Which transition violates mutual exclusion?
Three components have 2, 3 and 4 local states. What is the product bound on global state combinations?
Which pair describes abstraction methods that can support a sound safety check when their preservation conditions are proved?
A conservative abstraction returns a violating trace, but no matching execution exists in the original model. What should you conclude?
An abstract model passes a safety check. Which fact supports transferring that result to the concrete model?