Operations on Fixpoint Equation Systems

04/14/2023
by   Thomas Neele, et al.
0

We study operations on fixpoint equation systems (FES) over arbitrary complete lattices. We investigate under which conditions these operations, such as substituting variables by their definition, and swapping the ordering of equations, preserve the solution of a FES. We provide rigorous, computer-checked proofs. Along the way, we list a number of known and new identities and inequalities on extremal fixpoints in complete lattices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2020

Preservation of Equations by Monoidal Monads

If a monad T is monoidal, then operations on a set X can be lifted canon...
research
03/19/2020

Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations

Systems of fixpoint equations over complete lattices, consisting of (mix...
research
11/26/2017

Algorithms for the solution of systems of linear equations in commutative ring

Solution methods for linear equation systems in a commutative ring are d...
research
11/11/2021

Persistence of Periodic Orbits under State-dependent Delayed Perturbations: Computer-assisted Proofs

A computer-assisted argument is given, which provides existence proofs f...
research
08/28/2017

Short Presburger arithmetic is hard

We study the computational complexity of short sentences in Presburger a...
research
06/06/2022

u-generation: solving systems of polynomials equation-by-equation

We develop a new method that improves the efficiency of equation-by-equa...
research
06/19/2019

First order covariance inequalities via Stein's method

We propose probabilistic representations for inverse Stein operators (i....

Please sign up or login with your details

Forgot password? Click here to reset