Relation-algebraic computation of fixed points with applications

DOI10.1016/j.jlap.2005.04.007zbMath1086.68095OpenAlexW2086214237MaRDI QIDQ817578

Rudolf Berghammer

Publication date: 16 March 2006

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2005.04.007

zbMATH Keywords

fixed pointpermanentrelational algebracut completiongraph-theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Relation-algebraic specification and solution of special university timetabling problems ⋮ Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets ⋮ Computing and visualizing Banks sets of dominance relations using relation algebra and RelView ⋮ Contact, closure, topology, and the linking of row and column types of relations ⋮ State space analysis of Petri nets with relation-algebraic methods ⋮ Applying relation algebra and RelView to measures in a social network

Uses Software

• RelView

Cites Work

• Least reflexive points of relations
• Chain-complete posets and directed sets with applications
• A lattice-theoretical fixpoint theorem and its applications
• An extension of Tarski's fixed point theorem and its application to isotone complementarity problems
• Approximating the Permanent
• Two Basic Algorithms in Concept Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relation-algebraic computation of fixed points with applications