Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/10752
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCalder, Muffyen_UK
dc.contributor.authorShankland, Carronen_UK
dc.contributor.editorKim, Men_UK
dc.contributor.editorChin, Ben_UK
dc.contributor.editorKang, Sen_UK
dc.contributor.editorLee, Den_UK
dc.date.accessioned2016-12-14T22:47:39Z-
dc.date.available2016-12-14T22:47:39Zen_UK
dc.date.issued2001en_UK
dc.identifier.urihttp://hdl.handle.net/1893/10752-
dc.description.abstractA symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to data parameterised behaviours, and provides a finitely branching representation for behaviours. Symbolic bisimulation is defined and illustrated with reference to a telecomms example.The approach taken follows that applied to message passing CCS in [Hennessy and Lin 95], but differs in several significant aspects, taking account of the particular features of LOTOS: multi-way synchronisation, value negotiation, selection predicates.en_UK
dc.language.isoenen_UK
dc.publisherKluwer Academic Pressen_UK
dc.relationCalder M & Shankland C (2001) A symbolic semantics and bisimulation for Full LOTOS. In: Kim M, Chin B, Kang S & Lee D (eds.) Formal Techniques for Networked and Distributed Systems, FORTE 2001, IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems. IFIP Advances in Information and Communication Technology, Vol. 69. A symbolic semantics and bisimulation for Full LOTOS, Cheju Island, Korea, 28.08.2001-31.08.2001. New York, Boston, Dordrecht, London, Moscow: Kluwer Academic Press, pp. 185-200. http://link.springer.com/chapter/10.1007/0-306-47003-9_12en_UK
dc.relation.ispartofseriesIFIP Advances in Information and Communication Technology, Vol. 69en_UK
dc.rightsThe publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.en_UK
dc.rights.urihttp://www.rioxx.net/licenses/under-embargo-all-rights-reserveden_UK
dc.subjectLOTOSen_UK
dc.subjectsymbolic transition systemsen_UK
dc.subjectsymbolic bisimulationen_UK
dc.titleA symbolic semantics and bisimulation for Full LOTOSen_UK
dc.typeConference Paperen_UK
dc.rights.embargodate3000-12-01en_UK
dc.rights.embargoreason[forte01.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.citation.issn1868-4238en_UK
dc.citation.spage185en_UK
dc.citation.epage200en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusAM - Accepted Manuscripten_UK
dc.identifier.urlhttp://link.springer.com/chapter/10.1007/0-306-47003-9_12en_UK
dc.author.emailces1@stir.ac.uken_UK
dc.citation.btitleFormal Techniques for Networked and Distributed Systems, FORTE 2001, IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systemsen_UK
dc.citation.conferencedates2001-08-28 - 2001-08-31en_UK
dc.citation.conferencelocationCheju Island, Koreaen_UK
dc.citation.conferencenameA symbolic semantics and bisimulation for Full LOTOSen_UK
dc.citation.isbn978-0-7923-7470-1en_UK
dc.publisher.addressNew York, Boston, Dordrecht, London, Moscowen_UK
dc.contributor.affiliationUniversity of Glasgowen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.identifier.isiWOS:000174010000012en_UK
dc.identifier.wtid736880en_UK
dc.contributor.orcid0000-0001-7672-2884en_UK
dcterms.dateAccepted2001-12-31en_UK
dc.date.filedepositdate2013-01-23en_UK
rioxxterms.typeConference Paper/Proceeding/Abstracten_UK
rioxxterms.versionAMen_UK
local.rioxx.authorCalder, Muffy|en_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.contributorKim, M|en_UK
local.rioxx.contributorChin, B|en_UK
local.rioxx.contributorKang, S|en_UK
local.rioxx.contributorLee, D|en_UK
local.rioxx.freetoreaddate3000-12-01en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||en_UK
local.rioxx.filenameforte01.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source978-0-7923-7470-1en_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
forte01.pdfFulltext - Accepted Version12.34 MBAdobe PDFUnder Embargo until 3000-12-01    Request a copy


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.