Given a property and a (possibly infinite) computation tree T corresponding to the system model, a model-checking algorithm essentially examines T to check if T satisfies the property. For example, consider a property AF g where g is a propositional formula not involving any CTL connectives. Success in the model-checking field. SLAM took the PL world by storm –Spawned multiple copycat projects –Launched Microsoft’s Static Driver Verifier (released in the Windows DDK) 7 Model Checking There are complete courses in model checking (see ECEN 5139, Prof. Model Checking by Edmund M. Clarke, Orna Grumberg, and DoronA.
CTLmodel checking,implemented usingBDDs(JavaBDD library).
Utilization
Arguments:
- CTL standards (e.h.
Suggest(AG('t1'='Testosterone levels'), AF('c1'='T'))
); - path to model file, in the FSM format with the subsequent limitation:
- all the states must be univocally determined by the worth of their atomic propositions.
Fast start
- Install Scala and sbt
- Work lab tests with
help to make test
- Prepare container package deal with
make package deal
- Run demonstration with
java -jar /route/to/ctl-model-checking.jar 'AG(Not(And('d1'='T', 'd2'='T')))'./src/test/resources/mutual-exclusion.fsm
Example (output)
License
Copyright (Chemical) 2015 Federico Poli [email protected]
Launched under the GNU Common Public License, version 3