Interpretation of the Full Computation Tree Logic $CTL^*$ on Sets of Infinite Sequences
Interpretation of the Full Computation Tree Logic $CTL^*$ on Sets of Infinite Sequences
ISBN 3-540-63045-7
276-282
Nitsche, U.
6d9cf989-a6bb-4dee-b363-aa239b544072
Adian, S.
774b9ed9-1b8b-49e9-a4d7-a8e1989c108e
Nerode, A.
36b300fb-1330-488c-bc0d-1bd4171070a4
1997
Nitsche, U.
6d9cf989-a6bb-4dee-b363-aa239b544072
Adian, S.
774b9ed9-1b8b-49e9-a4d7-a8e1989c108e
Nerode, A.
36b300fb-1330-488c-bc0d-1bd4171070a4
Nitsche, U.
(1997)
Interpretation of the Full Computation Tree Logic $CTL^*$ on Sets of Infinite Sequences.
Adian, S. and Nerode, A.
(eds.)
Proc. 4th Int. Conf. Logical Foundations of Computer Science (LFCS), LNCS 1234.
.
Record type:
Conference or Workshop Item
(Other)
This record has no associated files available for download.
More information
Published date: 1997
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
Identifiers
Local EPrints ID: 250571
URI: http://eprints.soton.ac.uk/id/eprint/250571
ISBN: ISBN 3-540-63045-7
PURE UUID: 512bb1c1-503a-4d12-bc2b-ab56b7bce2f6
Catalogue record
Date deposited: 04 Aug 1999
Last modified: 07 Jan 2022 21:08
Export record
Contributors
Author:
U. Nitsche
Editor:
S. Adian
Editor:
A. Nerode
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics