Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/10744
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCalder, Muffyen_UK
dc.contributor.authorMaharaj, Savien_UK
dc.contributor.authorShankland, Carronen_UK
dc.date.accessioned2016-01-19T01:24:23Z-
dc.date.available2016-01-19T01:24:23Z-
dc.date.issued2002en_UK
dc.identifier.urihttp://hdl.handle.net/1893/10744-
dc.description.abstractSymbolic transition systems separate data from process behaviour by allowing the data to be uninstantiated. Designing an HML-like modal logic for these transition systems is interesting because of the subtle interplay between the quantifiers for the data and the modal operators (quantifiers on transitions). This paper presents the syntax and semantics of such a logic and discusses the design issues involved in its construction. The logic has been shown to be adequate with respect to strong early bisimulation over symbolic transition systems derived from Full LOTOS. We define what is meant by adequacy and discuss how we can reason about it with the aid of a mechanized theorem prover.en_UK
dc.language.isoenen_UK
dc.publisherOxford University Pressen_UK
dc.relationCalder M, Maharaj S & Shankland C (2002) A modal logic for Full LOTOS based on symbolic transition systems. Computer Journal, 45 (1), pp. 55-61. https://doi.org/10.1093/comjnl/45.1.55en_UK
dc.rightsPublisher policy allows this work to be made available in this repository. Published in Computer Journal (2002) 45 (1): 55-61 by Oxford University Press. The original publication is available at doi: 10.1093/comjnl/45.1.55en_UK
dc.titleA modal logic for Full LOTOS based on symbolic transition systemsen_UK
dc.typeJournal Articleen_UK
dc.identifier.doi10.1093/comjnl/45.1.55en_UK
dc.citation.jtitleComputer Journalen_UK
dc.citation.issn1460-2067en_UK
dc.citation.issn0010-4620en_UK
dc.citation.volume45en_UK
dc.citation.issue1en_UK
dc.citation.spage55en_UK
dc.citation.epage61en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusAM - Accepted Manuscripten_UK
dc.author.emailces1@stir.ac.uken_UK
dc.contributor.affiliationUniversity of Glasgowen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.identifier.isiWOS:000173481800008en_UK
dc.identifier.scopusid2-s2.0-0036167982en_UK
dc.identifier.wtid753297en_UK
dc.contributor.orcid0000-0002-0674-6044en_UK
dc.contributor.orcid0000-0001-7672-2884en_UK
dcterms.dateAccepted2002-12-31en_UK
dc.date.filedepositdate2013-01-23en_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionAMen_UK
local.rioxx.authorCalder, Muffy|en_UK
local.rioxx.authorMaharaj, Savi|0000-0002-0674-6044en_UK
local.rioxx.authorShankland, Carron|0000-0001-7672-2884en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.freetoreaddate2013-01-23en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/all-rights-reserved|2013-01-23|en_UK
local.rioxx.filenameCJpaper.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source0010-4620en_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
CJpaper.pdfFulltext - Accepted Version9.31 MBAdobe PDFView/Open


This item is protected by original copyright



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

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.