Kleene Algebra Research Articles

Polymorphic Iterable Sequential Effect Systems

Effect systems are lightweight extensions to type systems that can verify a wide range of important properties with modest developer burden. But our general understanding of effect systems is limited primarily to systems where the order of effects is irrelevant. Understanding such systems in terms of a semilattice of effects grounds understanding of the essential issues and provides guidance when designing new effect systems. By contrast, sequential effect systems—where the order of effects is important—lack an established algebraic structure on effects. We present an abstract polymorphic effect system parameterized by an effect quantale—an algebraic structure with well-defined properties that can model the effects of a range of existing sequential effect systems. We define effect quantales, derive useful properties, and show how they cleanly model a variety of known sequential effect systems. We show that for most effect quantales, there is an induced notion of iterating a sequential effect; that for systems we consider the derived iteration agrees with the manually designed iteration operators in prior work; and that this induced notion of iteration is as precise as possible when defined. We also position effect quantales with respect to work on categorical semantics for sequential effect systems, clarifying the distinctions between these systems and our own in the course of giving a thorough survey of these frameworks. Our derived iteration construct should generalize to these semantic structures, addressing limitations of that work. Finally, we consider the relationship between sequential effects and Kleene Algebras, where the latter may be used as instances of the former.

Compact Fuzzy Systems Based on Boolean Relations

This document presents some considerations and procedures to design a compact fuzzy system based on Boolean relations. In the design process, a Boolean codification of two elements is extended to a Kleene’s of three elements to perform simplifications for obtaining a compact fuzzy system. The design methodology employed a set of considerations producing equivalent expressions when using Boole and Kleene algebras establishing cases where simplification can be carried out, thus obtaining compact forms. In addition, the development of two compact fuzzy systems based on Boolean relations is shown, presenting its application for the identification of a nonlinear plant and the control of a hydraulic system where it can be seen that compact structures describes satisfactory performance for both identification and control when using algorithms for optimizing the parameters of the compact fuzzy systems. Finally, the applications where compact fuzzy systems are based on Boolean relationships are discussed allowing the observation of other scenarios where these structures can be used.

Varieties of pseudocomplemented Kleene algebras

AbstractIn this paper we study the subdirectly irreducible algebras in the variety of pseudocomplemented De Morgan algebras by means of their De Morgan p‐spaces. We introduce the notion of the body of an algebra and determine when is subdirectly irreducible. As a consequence of this, in the case of pseudocomplemented Kleene algebras, two special subvarieties arise naturally, for which we give explicit identities that characterise them. We also introduce a subvariety of , namely the variety of bundle pseudocomplemented Kleene algebras, fully describe its subvariety lattice and find explicit equational bases for each subvariety. In addition, we study the subvariety of generated by the simple members of , determine the structure of the free algebra over a finite set in this variety and their finite weakly projective algebras.

On the relation of negations in Nelson algebras

The aim of this paper is to investigate the relation between the strong and the "weak" or intuitionistic negation in Nelson algebras. To do this, we define the variety of Kleene algebras with intuitionistic negation and explore the Kalman's construction for pseudocomplemented distributive lattices. We also study the centered algebras of this variety.

Free Kleene algebras with domain

First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous case when the signature includes all the Kleene algebra with domain operations; that is, we add union and reflexive transitive closure to the signature. In this second case, elements of the free algebras are ‘regular’ sets of the trees of the first case. As a corollary, the axioms of domain semirings provide a finite quasiequational axiomatisation of the equational theory of algebras of binary relations for the intermediate signature of composition, union, and domain. Next we note that our regular sets of trees are not closed under complement, but prove that they are closed under intersection. Finally, we prove that under relational semantics the equational validities of Kleene algebras with domain form a decidable set.

Introducing Synchrony in Fuzzy Automata

This paper introduces a sort of automata and associated languages, often arising in modelling natural phenomena, in which both vagueness and simultaneity are taken as first class citizens. This requires a fuzzy semantics assigned to transitions and a precise notion of a synchronous product to enforce the simultaneous occurrence of actions. The expected relationships between automata and languages are revisited in this setting; in particular it is shown that any subset of a fuzzy synchronous language with the suitable signature forms a synchronous Kleene algebra.

Varieties of Regular Pseudocomplemented de Morgan Algebras

In this paper, we investigate the varieties $\mathbf M_n$ and $\mathbf K_n$ of regular pseudocomplemented de Morgan and Kleene algebras of range $n$, respectively. Priestley duality as it applies to pseudocomplemented de Morgan algebras is used. We characterise the dual spaces of the simple (equivalently, subdirectly irreducible) algebras in $\mathbf M_n$ and explicitly describe the dual spaces of the simple algebras in $\mathbf M_1$ and $\mathbf K_1$. We show that the variety $\mathbf M_1$ is locally finite, but this property does not extend to $\mathbf M_n$ or even $\mathbf K_n$ for $n \geq 2$. We also show that the lattice of subvarieties of $\mathbf K_1$ is an $\omega + 1$ chain and the cardinality of the lattice of subvarieties of either $\mathbf K_2$ or $\mathbf M_1$ is $2^{\omega}$. A description of the lattice of subvarieties of $\mathbf M_1$ is given.

PBZ*-Lattices: Structure Theory and Subvarieties

We investigate the structure theory of the variety of PBZ*-lattices and some of its proper subvarieties. These lattices with additional structure originate in the foundations of quantum mechanics and can be viewed as a common generalisation of orthomodular lattices and Kleene algebras expanded by an extra unary operation. We lay down the basics of the theories of ideals and of central elements in PBZ*-lattices, we prove some structure theorems, and we explore some connections with the theories of subtractive and binary discriminator varieties.

Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time

Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union (+) and iteration (*) operations from KAT to predicate-guarded versions. We develop the (co)algebraic theory of GKAT and show how it can be efficiently used to reason about imperative programs. In contrast to KAT, whose equational theory is PSPACE-complete, we show that the equational theory of GKAT is (almost) linear time. We also provide a full Kleene theorem and prove completeness for an analogue of Salomaa’s axiomatization of Kleene Algebra.

Design Methodology for the Implementation of Fuzzy Inference Systems Based on Boolean Relations

This paper proposes a methodology for the design of fuzzy inference systems based on Boolean relations. The approach using Boolean sets presents limited performance due to the abrupt transitions that occur during its functioning, therefore, fuzzy sets can be used aiming the improvement of the performance. In this approach, firstly, the design of a Boolean controller is performed, which is later extended into fuzzy under design guidelines proposed in this paper. The methodology uses Kleene algebra via truth tables for the fuzzy system design, allowing the simplification of the equations that implement the fuzzy system.

Left-handed completeness

We give a new proof of the completeness of the left-handed star rule of Kleene algebra. The proof is significantly shorter than previous proofs and exposes the rich interaction of algebra and coalgebra in the theory of Kleene algebra.

A new topological duality for n × m-valued Łukasiewicz–Moisil algebras

In 2000, Figallo and Sanza introduced [Formula: see text]-valued Łukasiewicz–Moisil algebras which are both a particular case of matrix Łukasiewicz algebras [W. Suchoń, Matrix Łukasiewicz Algebras, Rep. Math. Logic 4 (1975) 91–104] and a generalization of [Formula: see text]-valued Łukasiewicz–Moisil algebras. It is worth noting that unlike what happens in [Formula: see text]-valued Łukasiewicz–Moisil algebras, generally the De Morgan reducts of [Formula: see text]-valued Łukasiewicz–Moisil algebras are not Kleene algebras. Furthermore, in [C. Sanza, [Formula: see text]-valued Łukasiewicz algebras with negation, Rep. Math. Logic 40 (2006) 83–106] an important example which legitimated the study of this class of algebras is provided. In this paper, we continue the study of [Formula: see text]-valued Łukasiewicz–Moisil algebras (or [Formula: see text]-algebras). More precisely, we determine a new topological duality for these algebras. By means of this duality we characterize the congruences and specially the maximal congruences on [Formula: see text]-algebras. Then these characterizations allow us to assert that [Formula: see text]-algebras are semisimples and obtain a new description of subdirectly irreducible [Formula: see text]-algebras.

Specification and inference of trace refinement relations

The modern software engineering process is evolutionary, with commits/patches begetting new versions of code, progressing steadily toward improved systems. In recent years, program analysis and verification tools have exploited version-based reasoning, where new code can be seen in terms of how it has changed from the previous version. When considering program versions, refinement seems a natural fit and, in recent decades, researchers have weakened classical notions of concrete refinement and program equivalence to capture similarities as well as differences between programs. For example, Benton, Yang and others have worked on state-based refinement relations . In this paper, we explore a form of weak refinement based on trace relations rather than state relations. The idea begins by partitioning traces of a program C 1 into trace classes, each identified via a restriction r 1 . For each class, we specify similar behavior in the other program C 2 via a separate restriction r 2 on C 2 . Still, these two trace classes may not yet be equivalent so we further permit a weakening via a binary relation A on traces, that allows one to, for instance disregard unimportant events, relate analogous atomic events, etc. We address several challenges that arise. First, we explore one way to specify trace refinement relations by instantiating the framework to Kleene Algebra with Tests (KAT) due to Kozen. We use KAT intersection for restriction, KAT hypotheses for A , KAT inclusion for refinement, and have proved compositionality. Next, we present an algorithm for automatically synthesizing refinement relations, based on a mixture of semantic program abstraction, KAT inclusion, a custom edit-distance algorithm on counterexamples, and case-analysis on nondeterministic branching. We have proved our algorithm to be sound. Finally, we implemented our algorithm as a tool called Knotical, on top of Interproc and Symkat. We demonstrate promising first steps in synthesizing trace refinement relations across a hand-crafted collection of 37 benchmarks that include changing fragments of array programs, models of systems code, and examples inspired by the thttpd and Merecat web servers.

Prime filter structures of pseudocomplemented Kleene algebras and representation by rough sets

We introduce Kleene-Varlet spaces as partially ordered sets equipped with a polarity satisfying certain additional conditions. By applying Kleene-Varlet spaces, we prove that each regular pseudocomplemented Kleene algebra is isomorphic to a subalgebra of the rough set regular pseudocomplemented Kleene algebra defined by a tolerance induced by an irredundant covering. We also characterize the Kleene-Varlet spaces corresponding to the regular pseudocomplemented Kleene algebras satisfying the Stone identity.

Explaining SDN Failures via Axiomatisations

This work introduces a concept of explanations with respect to the violation of safe behaviours within software defined networks (SDNs) expressible in NetKAT. The latter is a network programming language that is based on a well-studied mathematical structure, namely, Kleene Algebra with Tests (KAT). Amongst others, the mathematical foundation of NetKAT gave rise to a sound and complete equational theory. In our setting, a safe behaviour is characterised by a NetKAT policy which does not enable forwarding packets from ingress to an undesirable egress. Explanations for safety violations are derived in an equational fashion, based on a modification of the existing NetKAT axiomatisation.

SOME RESULTS ON REGULAR EXPRESSIONS FOR MULTITAPE FINITE AUTOMATA

We consider sets of word tuples accepted by multitape finite automata. We use the known notation for regular expressions that describes languages accepted by one-tape automata. Nevertheless, the interpretation of the "concatenation" operation is different in this case. The algebra of events for multitape finite automata is defined in the same way as for one-tape automata. It is shown that the introduced algebra is a Kleene algebra. It is also, shown that some known results for the algebra of events accepted by one-tape finite automata are valid in this case too.

On Endomorphism Monoids of Finite Kleene Algebras

An endomorphism monoid of an algebra [Formula: see text] is said to be a band if every endomorphism on [Formula: see text] is an idempotent, and it is said to be a demi-band if every non-injective endomorphism on [Formula: see text] is an idempotent. We precisely determine finite Kleene algebras whose endomorphism monoids are demi-bands and bands via Priestley duality.

Logics based on linear orders of contaminating values

AbstractA wide family of many-valued logics—for instance, those based on the weak Kleene algebra—includes a non-classical truth-value that is ‘contaminating’ in the sense that whenever the value is assigned to a formula $\varphi $, any complex formula in which $\varphi $ appears is assigned that value as well. In such systems, the contaminating value enjoys a wide range of interpretations, suggesting scenarios in which more than one of these interpretations are called for. This calls for an evaluation of systems with multiple contaminating values. In this paper, we consider the countably infinite family of multiple-conclusion consequence relations in which classical logic is enriched with one or more contaminating values whose behaviour is determined by a linear ordering between them. We consider some motivations and applications for such systems and provide general characterizations for all consequence relations in this family. Finally, we provide sequent calculi for a pair of four-valued logics including two linearly ordered contaminating values before defining two-sided sequent calculi corresponding to each of the infinite family of many-valued logics studied in this paper.

Intuitionistic ancestral logic

Abstract In this article we define pure intuitionistic Ancestral Logic ( iAL ), extending pure intuitionistic First-Order Logic ( iFOL ). This logic is a dependently typed abstract programming language with computational functionality beyond iFOL given by its realizer for the transitive closure, TC . We derive this operator from the natural type theoretic definition of TC using intersection. We show that provable formulas in iAL are uniformly realizable, thus iAL is sound with respect to constructive type theory. We further show that iAL subsumes Kleene Algebras with tests and thus serves as a natural programming logic for proving properties of program schemes. We also extract schemes from proofs that iAL specifications are solvable.

An Extensible Automated Failure Localization Framework Using NetKAT, Felix, and SDN Traceroute

Designing, implementing, and maintaining network policies that protect from internal and external threats is a highly non-trivial task. Often, troubleshooting networks consisting of diverse entities realizing complex policies is even harder. Software-defined networking (SDN) enables networks to adapt to changing scenarios, which significantly lessens human effort required for constant manual modifications of device configurations. Troubleshooting benefits SDN’s method of accessing forwarding devices as well, since monitoring is made much easier via unified control channels. However, by making policy changes easier, the job of troubleshooting operators is made harder too: For humans, finding, analyzing, and fixing network issues becomes almost intractable. In this paper, we present a failure localization framework and its proof-of-concept prototype that helps in automating the investigation of network issues. Like a controller for troubleshooting tools, our framework integrates the formal specification (expected behavior) and network monitoring (actual behavior) and automatically gives hints about the location and type of network issues by comparing the two types of information. By using NetKAT (Kleene algebra with tests) for formal specification and Felix and SDN traceroute for network monitoring, we show that the integration of these tools in a single framework can significantly ease the network troubleshooting process.