Graded Computation Tree Logic with Binary Coding
BIANCO, ALESSANDRO and MOGAVERO, FABIO and MURANO, ANIELLO (2010) Graded Computation Tree Logic with Binary Coding. In: 19th EACSL Annual Conference on Computer Science Logic, CSL 2010, August 23 - 27, 2010, Brno Czech Republic.
Full text non disponibile da questo archivio.
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 statemen
Solo per gli Amministratori dell'archivio: edita il record