An axiomatization of full computation tree logic
Tools
Reynolds, M. (2001) An axiomatization of full computation tree logic. Journal of Symbolic Logic, 66 (3). pp. 1011-1057.
Abstract
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.
Item Type: | Journal Article |
---|---|
Murdoch Affiliation(s): | School of Information Technology |
Publisher: | Association for Symbolic Logic |
Copyright: | © Association for Symbolic Logic |
Publisher's Website: | http://www.aslonline.org/journals-journal.html |
URI: | http://researchrepository.murdoch.edu.au/id/eprint/12272 |
![]() |
Item Control Page |
Downloads
Downloads per month over past year