Duality of Fix-Points for Distributive Lattices
We present a novel algorithm for calculating fix-points. The algorithm calculates fix-points of an endo-function f on a distributive lattice, by performing reachability computation a graph derived from the dual of f; this is in comparison to traditional algorithms that are based on iterated applicat...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We present a novel algorithm for calculating fix-points. The algorithm
calculates fix-points of an endo-function f on a distributive lattice, by
performing reachability computation a graph derived from the dual of f; this is
in comparison to traditional algorithms that are based on iterated application
of f until a fix-point is reached. |
|---|---|
| DOI: | 10.48550/arxiv.cs/0609118 |