A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Graded Computation Tree Logic with Binary Coding
[chapter]
2010
Lecture Notes in Computer Science
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 µ-CALCULUS (Gµ-CALCULUS) where it allows to express
doi:10.1007/978-3-642-15205-4_13
fatcat:jbnz3kesfvdorluldngrx3dq4e