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

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.

Keywords
LOTOS; symbolic transition systems; symbolic bisimulation