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 Sciences and Engineering > Electronics and Computer Science
ePrint ID: 250571
Date Deposited: 04 Aug 1999
Last Modified: 27 Mar 2014 19:51
Publisher: Springer-Verlag, Berlin
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/250571

Actions (login required)

View Item View Item