Formal Verification Studio
Check finite transition systems against branching temporal logic and inspect witnesses, counterexamples and fixed-point obligations.
Application guideVerifying your session…
Using Formal Verification Studio
Verify temporal properties of an explicit finite transition system.
CTL properties · Counterexample traces · Proof obligations
- Inputs and working data
- States, labels, initial states, named transitions and nested CTL formulas.
- Working in the editor
- Transition and CTL editors with property-specific evidence inspector.
- What can I produce?
- Property verdicts, subformula state sets, initial counterexamples and finite or looping paths.
- What are the limits?
- 120 finite states, terminal stutter, no fairness assumptions; branching proofs use state sets.
- Example
- Library reservation collection and return model.