Shankland C & Thomas M (1997) Symbolic Bisimulation for Full LOTOS. In: Johnson M (ed.) Algebraic Methodology and Software Technology: 6th International Conference, AMAST'97 Sydney, Australia, December13–17, 1997 Proceedings. Lecture Notes in Computer Science, 1349. 6th International Conference, AMAST'97, Sydney, Australia, 13.12.1997-17.12.1997. Berlin Heidelberg: Springer, pp. 479-493. http://link.springer.com/chapter/10.1007/BFb0000491#; https://doi.org/10.1007/BFb0000491
Abstract A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined, following the approach taken for message passing CCS in [HL95a], altered to take account of the particular features of LOTOS (multi-way synchronisation, value negotiation, selection predicates). Symbolic bisimulation over symbolic transition systems is defined, and symbolic bisimulation on ground behaviour expressions is shown to preserve the usual concrete (strong) bisimulation on the standard semantics. Finally, a modal logic based on symbolic transition systems is defined. All are illustrated with reference to examples.