scientific article; zbMATH DE number 3995637
[For the entire collection see Zbl 0578.00001.] Least fixed points of monotonic operators have been traditionally employed in abstract semantics of programs. However, it can be demonstrated by several examples that also the dual concept, viz. greatest fixed points, may have a considerable interpretation, especially in the context of infinite behaviour of effective devices. Again, there are some computational phenomena which can be adequately characterized just by a combination of both least and greatest fixed point operators. In several papers, extremal fixed point operators have been added to a logic to increase its expressive power; the resulting systems, called \(\mu\)-calculi, depend of course on the underlying logics. It seems however that a number of properties of the fixed point operators is of equational character and so can be approached by simpler, universal- algebra techniques. This paper tries to advocate this point of view. We extend the traditional language of an algebra by allowing least and greatest fixed point operators in construction of a term and consider inequalities besides equalities. Then we formulate a Birkhoff-like system of rules which turns out to be complete for a certain class of algebras.
- On the approximation of denotational mu-semantics
- Fixed point characterization of infinite behavior of finite-state systems
- On the equational definition of the least prefixed point.
- Algebraically complete semirings and Greibach normal form
- On diagonal fixed points of increasing functions
- The differential \(\lambda \mu\)-calculus
- Axiomatizing weighted synchronization trees and weighted bisimilarity
- Properties of fixed point operators in predicate algebras
- Equational properties of fixed point operations in Cartesian categories: an overview
- scientific article; zbMATH DE number 4204632 (Why is no real title available?)
- -Calculus with Explicit Points and Approximations
- On the equational definition of the least prefixed point
- μ-Bicomplete Categories and Parity Games
- scientific article; zbMATH DE number 7357543 (Why is no real title available?)
- Equational properties of fixed-point operations in Cartesian categories: an overview
- Free -lattices
- Fixed-point calculus
- Axiomatizing the equational theory of regular tree languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723706)