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 not available from this repository.| Item Type: | Conference or Workshop Item (UNSPECIFIED) | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Lingua: | English | ||||||||
| Title: | Graded Computation Tree Logic with Binary Coding | ||||||||
| Creators: |
|
||||||||
| Autore/i: | Alessandro Bianco, Fabio Mogavero, Aniello Murano | ||||||||
| Date: | 2010 | ||||||||
| Number of Pages: | 0 | ||||||||
| Department: | Scienze fisiche | ||||||||
| Event Title: | 19th EACSL Annual Conference on Computer Science Logic, CSL 2010 | ||||||||
| Event Location: | Brno Czech Republic | ||||||||
| Event Dates: | August 23 - 27, 2010 | ||||||||
| Title of Book: | 19th EACSL Annual Conference on Computer Science Logic, CSL 2010 | ||||||||
| Publisher: | Springer-Verlag | ||||||||
| Date: | 2010 | ||||||||
| Volume: | LNCS | ||||||||
| Page Range: | pp. 1-15 | ||||||||
| Number of Pages: | 0 | ||||||||
| Date Deposited: | 18 Oct 2010 08:14 | ||||||||
| Last Modified: | 30 Apr 2014 19:41 | ||||||||
| URI: | http://www.fedoa.unina.it/id/eprint/5390 |
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 statemen
Downloads
Downloads per month over past year
Actions (login required)
 |
View Item |
