Information Services banner Edinburgh Research Archive The University of Edinburgh crest

Edinburgh Research Archive >
Informatics, School of >
Informatics thesis and dissertation collection >

Please use this identifier to cite or link to this item:

This item has been viewed 18 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
ECS-LFCS-90-119.PDFAdobe PDF11.67 MBAdobe PDFView/Open
ECS-LFCS-90-119.psPostScript file1.48 MBPostscriptView/Open
Title: Relevance Logic and Concurrent Composition
Authors: Dam, Mads F
Supervisor(s): Stirling, Colin
Issue Date: Nov-1990
Publisher: University of Edinburgh. College of Science and Engineering. School of Informatics.
Abstract: Compositionality, i.e. that properties of composite systems are deduced in terms of those of their immediate constituents, is crucial to the tractability and practical usefulness of program logics. A general technique for obtaining this for parallel composition appeals to a relativisation of properties with respect to properties of parallel environments. This induces a notion of consequence on properties which will in general be a relevant one. Based on this observation we suggest using modal or temporal extensions of relevance logics to build compositional logics for processes. We investigate the general model theory of propositional relevance logic and introduce a notion of model based on semilattices with an inf-preserving binary operation. We present a number of correspondence and completeness results, investigate the relationship to Sylvan and Meyer's ternary model, and present concrete models based on Milner's SCCS. To account for dynamic behaviour a modal extension of linear logic is introduced, interpreted over models extended by prefixing in the style of CCS/SCCS. We show a variety of characterisation results, relating models to processes under testing preorders, and obtain completeness results, first for the general algebraically based interpretations and next for the process-based ones giving, for the latter, procedures for deciding validity and satisfiability of formulas. From a computational point of view the processes considered are unacceptably weak in that they lack a suitable notion of external, or controllable, choice. To remedy this we consider indexed modal models under weak preorders, generalising notions of process equivalence such as testing and failures equivalence. We give characterisations of these in terms of modal logic and axiomatise the logics obtained. Relevant extensions of these logics are introduced, interpreted over model classes on which a parallel composition is defined. We axiomatise the logics obtained, giving decision procedures as before, and conclude by specialising the results to testing equivalence and synchronous parallel composition.
Appears in Collections:Informatics thesis and dissertation collection

Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh 2013, and/or the original authors. Privacy and Cookies Policy