Abstract : We introduce a notion of proof for CTL with respect to a given nite model and show some advantages of using such a notion. This also suggests to de ne a slight extension of CTL, called SCTL, where predicates can have an arbitrary arity.
https://hal.inria.fr/hal-00919467
Contributeur : Gilles Dowek
<>
Soumis le : vendredi 17 janvier 2014 - 17:37:18
Dernière modification le : vendredi 25 mai 2018 - 12:02:06
Document(s) archivé(s) le : vendredi 18 avril 2014 - 11:22:21
