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 Adian, S. and Nerode, A. (eds.) At Proc. 4th Int. Conf. Logical Foundations of Computer Science (LFCS), LNCS 1234. , pp. 276-282.

Download

Full text not available from this repository.

Item Type: Conference or Workshop Item (Other)
Additional Information: Address: Yaroslavl, Russia
Venue - Dates: Proc. 4th Int. Conf. Logical Foundations of Computer Science (LFCS), LNCS 1234, 1997-01-01
Organisations: Electronics & Computer Science
ePrint ID: 250571
Date :
Date Event
1997Published
Date Deposited: 04 Aug 1999
Last Modified: 18 Apr 2017 00:19
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/250571

Actions (login required)

View Item View Item