Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling

Several methodologies and most automatic tool support for LOTOS [1] can only be used if the specifications considered describe finite-state machines [2,3,4]. For example, an equivalence verifier can only manipulate specifications in this class; an attempt to verify the equivalence of two non finite-state processes may not terminate with an answer. However, as it is known, LOTOS gives the possibility to describe also non finite-state systems. So it could be useful to provide methodologies and tools for verification on this class of systems. Indeed more powerful verification techniques have recently been exploited for non-finite state systems defined in other process algebras.