A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
A fixpoint theory for non-monotonic parallelism
2003
Theoretical Computer Science
This paper studies parallel recursion. The trace speciÿcation language used in this paper incorporates sequentially, nondeterminism, reactiveness (including inÿnite traces), three forms of parallelism (including conjunctive, fair-interleaving and synchronous parallelism) and general recursion. In order to use Tarski's theorem to determine the ÿxpoints of recursions, we need to identify a well-founded partial order. Several orders are considered, including a new order called the lexical order,
doi:10.1016/s0304-3975(02)00893-9
fatcat:cta57rzx5nhsvazlpy3ew5ezgm