An example of sequentialization of a parallel algorithm (Q1262778)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An example of sequentialization of a parallel algorithm |
scientific article; zbMATH DE number 4125025
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An example of sequentialization of a parallel algorithm |
scientific article; zbMATH DE number 4125025 |
Statements
An example of sequentialization of a parallel algorithm (English)
0 references
1989
0 references
The verification that a finite transition system, representing a process, satisfies a formula of some branching-time logic amounts to computing the least fixed point of a system of equations over this transition system. \textit{A. Arnold} and \textit{P. Crubille} [Inf. Process. Lett. 29, No.2, 57- 66 (1988; Zbl 0663.68075)] proposed a sequential algorithm to compute these least fixed points. It is shown how this algorithm could be derived from a parallel one.
0 references
parallel algorithm
0 references
finite transition system
0 references
least fixed point
0 references
