Interpretation of the Full Computation Tree Logic $CTL^*$ on Sets of Infinite Sequences
Nitsche, U. (1997) Interpretation of the Full Computation Tree Logic $CTL^*$ on Sets of Infinite Sequences. Proc. 4th Int. Conf. Logical Foundations of Computer Science (LFCS), LNCS 1234 Springer-Verlag, Berlin, 276-282.
Download
Full text not available from this repository.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | Address: Yaroslavl, Russia |
| ISBNs: | 3540630457 |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 250571 |
| Date Deposited: | 04 Aug 1999 |
| Last Modified: | 02 Mar 2012 12:38 |
| Contributors: | Nitsche, U. (Author) Adian, S. (Editor) Nerode, A. (Editor) |
| Date: | 1997 |
| Additional Information: | Address: Yaroslavl, Russia |
| Status: | Published |
| Publisher: | Springer-Verlag, Berlin |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/250571 |
Actions (login required)
 |
View Item |
