Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S1567-8326(01)00005-4 | J. Log. Algebr. Program. |
Keywords | Field | DocType |
parallel pcrl,greibach normal form,process algebra,recursive specification,equivalence relation,explicit notion,and phrases: crl,linearization algorithm,linear form,formal language theory,linearization of recursive specications,data-parametric grammar,linearization of recursive specifications,μcrl,normal form,formal language | Equivalence relation,Formal language,Algebra,Linear form,Correctness,Algorithm,Greibach normal form,Process calculus,Recursion,Mathematics,Linearization | Journal |
Volume | Issue | ISSN |
48 | 1-2 | Journal of Logic and Algebraic Programming |
Citations | PageRank | References |
17 | 1.11 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan F Groote | 1 | 40 | 2.77 |
| Alban Ponse | 2 | 404 | 38.05 |
| Yaroslav S. Usenko | 3 | 125 | 10.75 |