Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CSL
2010
Springer

favoriteEmaildiscussreport

185views Automated Reasoning» more CSL 2010»

Graded Computation Tree Logic with Binary Coding

13 years 5 months ago

Graded Computation Tree Logic with Binary Coding

Download people.na.infn.it

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

Alessandro Bianco, Fabio Mogavero, Aniello Murano

Real-time Traffic

Automated Reasoning | CSL 2010 | Graded | Path Quantifiers | Universal Path Quantifiers |

claim paper

Related Content

» RankActivity A Canonical Form for Binary Resolution

» Color image coding indexing and retrieval using binary space partitioning tree

» Storing and restoring visual input with collaborative rank coding and associative memory

» GradedCTL Satisfiability and Symbolic Model Checking

» An Introduction to Binary Search Trees and Balanced Trees

» Tree Pruning for Output Coded Ensembles

» CompactKdt Compact signatures for accurate large scale object recognition

» Greedy Learning of Binary Latent Trees

» Characterizing EF and EX Tree Logics

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2010
Where	CSL
Authors	Alessandro Bianco, Fabio Mogavero, Aniello Murano

Comments (0)