Duality of Fix-Points for Distributive Lattices

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
7 pages

Keywords

Data Structures and Algorithms, Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/116165

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0609118
 http://arxiv.org/abs/cs/0609118

Collections

arXiv