Expressiveness for Highly Nested Expressions in Linear Temporal Logic
Expressiveness for Highly Nested Expressions in Linear Temporal Logic
In the case where one only uses the modalities always, sometime and next it is shown that nesting modalities do not constrain a model in the limit any more than a non-nested formula. It is also proved that when the until modality operator is included then nesting modalities does constrain the limit of a model more than any non-nested formula.
263-272
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049
1994
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049
Mitchell, Bill
(1994)
Expressiveness for Highly Nested Expressions in Linear Temporal Logic.
Journal of Logic and Computation, 4 (3), .
(doi:10.1093/logcom/4.3.263).
Abstract
In the case where one only uses the modalities always, sometime and next it is shown that nesting modalities do not constrain a model in the limit any more than a non-nested formula. It is also proved that when the until modality operator is included then nesting modalities does constrain the limit of a model more than any non-nested formula.
Other
Nest_Exp_LTL_Journal_of_Logic_and_Computation_Vol_4_No_3_1994.ps
- Other
More information
Published date: 1994
Organisations:
Electronics & Computer Science, IT Innovation
Identifiers
Local EPrints ID: 266059
URI: http://eprints.soton.ac.uk/id/eprint/266059
PURE UUID: 11e3caf0-8313-4710-9fe3-1e2b41c65737
Catalogue record
Date deposited: 04 Jul 2008 20:37
Last modified: 14 Mar 2024 08:20
Export record
Altmetrics
Contributors
Author:
Bill Mitchell
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