|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
|Title:||A symbolic semantics and bisimulation for Full LOTOS|
|Citation:||Calder 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_12|
|Series/Report no.:||IFIP Advances in Information and Communication Technology, Vol. 69|
|Conference Name:||A symbolic semantics and bisimulation for Full LOTOS|
|Conference Dates:||2001-08-28 - 2001-08-31|
|Conference Location:||Cheju Island, Korea|
|Abstract:||A 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.|
|Status:||AM - Accepted Manuscript|
|Rights:||The 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.|
|forte01.pdf||Fulltext - Accepted Version||12.34 MB||Adobe PDF||Under Embargo until 3000-12-01 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
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 email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.