An Axiomatization of Full Computation Tree Logic
Reynolds, M.
J. Symbolic Logic, Tome 66 (2001) no. 1, p. 1011-1057 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic.
Publié le : 2001-09-14
Classification:  
@article{1183746544,
     author = {Reynolds, M.},
     title = {An Axiomatization of Full Computation Tree Logic},
     journal = {J. Symbolic Logic},
     volume = {66},
     number = {1},
     year = {2001},
     pages = { 1011-1057},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746544}
}

Reynolds, M. An Axiomatization of Full Computation Tree Logic. J. Symbolic Logic, Tome 66 (2001) no. 1, pp.  1011-1057. http://gdmltest.u-ga.fr/item/1183746544/