Can an Equation Solver Handle Lattice Functions with Join and Meet Operators?

  • Thread starter Thread starter Learner
  • Start date Start date
  • Tags Tags
    Lattice
Learner
Messages
3
Reaction score
0
Hi,

I need some direction help. The problem I am facing is related to solutions of equations , where equations are montone functions over complete lattice , operators being meet and join and the solution set should range over elements of lattice.

Normally data flow analysis problems in compilers are modeled as above, where the solution to equations is calculated by fixpoint calculation.

I am looking for an equation solver, that takes equations over lattice values,with operators (join and meet, instead of + -), and can provide me a solution set.

Example.

Take X, Y as variables to be determined whose domains are complete lattice L.
U is join operator. ^ is a meet operator. a,b,c are constants , the values from lattice L

X = (X U Y ) ^ a; eq-1
Y = X^b; eq-2

Suppose the above equations are montone. Then using fixpoint iteration , we can solve these equations.


I want a tool that takes such equations and solves them.
 
Physics news on Phys.org
Learner said:
Take X, Y as variables to be determined whose domains are complete lattice L.
U is join operator. ^ is a meet operator. a,b,c are constants , the values from lattice L

X = (X U Y ) ^ a; eq-1
Y = X^b; eq-2

Suppose the above equations are montone. Then using fixpoint iteration , we can solve these equations.


I want a tool that takes such equations and solves them.

Structure You describe is very general, but it also is algebra. So probably You should ask for software which works in general algebra and finds ( construct is probably better word) solutions. I assume that You know some algorithms for solving equations You show? If Yes, You probably may implement them efficiently in Sage environment ( by means of GAP but not only).
I have hope I help You anyway.
Regards
Kazek
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top