Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
Enhancing model checking in verification by AI techniques
Artificial Intelligence
Model checking
NUSMV: A New Symbolic Model Verifier
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
CTL model update for system modifications
Journal of Artificial Intelligence Research
Machine learning biochemical networks from temporal logic properties
Transactions on Computational Systems Biology VI
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
| Hi-index | 0.00 |
We present a recursive algorithm to update a Kripke model so as to satisfy a formula of the Computation-Tree Logic (CTL). Recursive algorithms for model update face a difficulty: deleting (adding) transitions from (to) a Kripke model to satisfy a universal (an existential) subformula may dissatisfy some existential (universal) subformulas. Our method employs protected models to overcome this difficulty. We demonstrate our algorithm with a classical example of automatic synthesis described by Emerson and Clarke in 1982. From a dummy model, where the accessibility relation is the identity relation, our algorithm can efficiently generate a model to satisfy a specification of mutual exclusion in a variant of CTL. Such a variant extends CTL with an operator that limits the out-degree of states. We compare our method with a generateand-test algorithm and outline a proof of soundness and completeness for our method.