Symbolic bisimulation for Full LOTOS [chapter]

Carron Shankland, Muffy Thomas
1997 Lecture Notes in Computer Science  
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is de ned, 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 de ned, and symbolic bisimulation on ground behaviour expressions is shown to preserve the usual concrete (strong) bisimulation on the standard semantics.
more » ... y, a modal logic based on symbolic transition systems is de ned. All are illustrated with reference to examples. ? This author was partially supported by a grant from the British Council enabling travel from Scotland to the Netherlands. 4 Full LOTOS is Basic LOTOS plus algebraic data types. In the remainder of this paper the term LOTOS refers to Full LOTOS.
doi:10.1007/bfb0000491 fatcat:d3jytrnhafd5dpmqtfk34ibmea