Graded Computation Tree Logic with Binary Coding

Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the branching-time temporal logic CTL (GCTL), in such a way that they can express statements about a minimal and conservative number of accessible paths. These quantifiers naturally extend to paths the concept of graded world modalities, which has been deeply investigated for the

• Type: Conference
• Year: 2010
• Where: CSL
• Authors: Alessandro Bianco, Fabio Mogavero, Aniello Murano
• Keywords: Automated Reasoning, CSL 2010, Graded, Path Quantifiers, Universal Path Quantifiers