𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A useful fixpoint theorem

✍ Scribed by Josef Niederle

Publisher
Springer Milan
Year
1998
Tongue
Italian
Weight
82 KB
Volume
47
Category
Article
ISSN
0009-725X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Using Net Refinement to Compute the Fixp
Using Net Refinement to Compute the Fixpoint of a Recursive Expression
✍ Eike Best; Maciej Koutny πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 112 KB

The talk illustrates the general Petri net semantics of equations such a s X = term(X) using a basic CCS-like process algebra without restriction, synchronisation and relabelling.

Fixpoint semantics and simulation
Fixpoint semantics and simulation
✍ Wim H. Hesselink; Albert Thijs πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 220 KB

A general functorial framework for recursive deΓΏnitions is presented in which simulation of a deΓΏnition scheme by another one implies an ordering between the values deΓΏned by these schemes in an arbitrary model. Under mild conditions on the functor involved, the converse implication also holds: a mo

A fixpoint theory for non-monotonic para
A fixpoint theory for non-monotonic parallelism
✍ Yifeng Chen πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 290 KB

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 or