“…The past ten years have seen the development of a variety of automatic verification tools for finite-state systems expressed in process algebra; examples include MAUTO [6], the Concurrency Workbench [10], TAV [14], and Ald~baran [11]. In general, these tools support a specific language, such as CCS [19], Meije [1], or Basic Lotos [5], for describing systems and provide users different methods, such as equivalence checking, preorder checking, model checking, random simulation, and abstraction mechanisms, for analyzing their behavior.…”