Graded Computation Tree Logic with Binary Coding
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 statements about a given number of immediately accessible worlds. As for the ”non-graded” case, it has been shown that the satisfiability problem for GCTL and the Gμ- Calculus coincides and, in particular, it remains solvable in ExpTime. However, GCTL has been only investigated w.r.t. graded numbers coded in unary, while Gμ- Calculus uses for this a binary coding, and it was left open the problem to decide whether the same result may or may not hold for binary GCTL. In this paper, by exploiting an automata theoretic-approach, which involves a model of alternating automata with satellites, we answer positively to this question. We further investigate the succinctness of binary GCTL and show that it is at least exponentially more succinct than Gμ- Calculus.
KeywordsModel Check Binary Code Atomic Proposition Acceptance Condition Kripke Structure
Unable to display preview. Download preview PDF.
- 1.Apostol, T.M.: Introduction to Analytic Number Theory. Springer, Heidelberg (1976)Google Scholar
- 2.Bianco, A., Mogavero, F., Murano, A.: Graded Computation Tree Logic. In: LICS 2009, pp. 342–351 (2009)Google Scholar
- 9.De Giacomo, G., Lenzerini, M.: Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus. In: ECAI 1994, pp. 411–415 (1994)Google Scholar
- 11.Kupferman, O., Sattler, U., Vardi, M.Y.: The Complexity of the Graded μ-Calculus. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 423–437. Springer, Heidelberg (2002)Google Scholar
- 12.Kupferman, O., Vardi, M.Y.: Memoryful Branching-Time Logic. In: LICS 2006, pp. 265–274. IEEE Computer S., Los Alamitos (2006)Google Scholar
- 14.Lamport, L.: “Sometime” is Sometimes “Not Never”: On the Temporal Logic of Programs. In: POPL 1980, pp. 174–185 (1980)Google Scholar
- 16.Lutz, C.: Complexity and Succinctness of Public Announcement Logic. In: AAMAS 2006, pp. 137–143 (2006)Google Scholar
- 19.Pnueli, A.: The Temporal Logic of Programs. In: FOCS 1977, pp. 46–57 (1977)Google Scholar
- 23.Vardi, M.Y., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: LICS 1986, pp. 332–344 (1986)Google Scholar