Exploiting symbolic traversal techniques for efficient Process Algebra Manipulation

Process Algebras are attracting people from the engineering community, as they are a suitable formalism for describing systems at very high abstraction levels and for proving equivalences and properties. In the past, the application of Process Algebras was hindered by the inefficiency of the tools. Recent developments in the field of boolean function representation with Binary Decision Diagrams and of symbolic traversal techniques allow us to bridge the gap. This paper presents an efficient tool for Process Algebra manipulation that extends and enhances the work of [EFTa91]. The system is open and flexible, as any Process Algebra operator can easily be integrated in it.