State space generation for the HAVi leader election protocol
Science of Computer Programming
Analysis of an Industrial System
Formal Methods in System Design
| Hi-index | 0.00 |
We describe a linearization algorithm for parallel pCRL processes similar to the one implemented in the linearizer of the \mcrl\ Toolset. This algorithm finds its roots in formal language theory: the `grammar'' defining a process is transformed into a variant of Greibach Normal Form. Next, any such form is further reduced to \emph{linear form}, i.e., to an equation that resembles a right-linear, data-parametric grammar. We aim at proving the correctness of this linearization algorithm. To this end we define an equivalence relation on recursive specifications in \mcrl\ that is model independent and does not involve an explicit notion of solution.