Symbolic Bisimulation for Full LOTOS

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. Finally, a modal logic based on symbolic transition systems is de ned. All are illustrated with reference to examples.

• Type: Conference
• Year: 1997
• Where: AMAST
• Authors: Carron Shankland, Muffy Thomas
• Keywords: AMAST 1997, Software Engineering, Symbolic Bisimulation, Symbolic Semantics, Symbolic Transition Systems