English
Related papers

Related papers: A note on commutative Kleene algebra

200 papers

Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests. This paper introduces two generalisations of…

Logic in Computer Science · Computer Science 2019-11-05 Leandro Gomes , Alexandre Madeira , Luís Soares Barbosa

We study versions of Kleene algebra with dynamic tests, that is, extensions of Kleene algebra with domain and antidomain operators. We show that Kleene algebras with tests and Propositional dynamic logic correspond to special cases of the…

Logic in Computer Science · Computer Science 2023-11-14 Igor Sedlár

Weighted programs generalize probabilistic programs and offer a framework for specifying and encoding mathematical models by means of an algorithmic representation. Kleene algebra with tests is an algebraic formalism based on regular…

Logic in Computer Science · Computer Science 2023-03-02 Igor Sedlár

Kleene algebra with tests (KAT) is an algebraic framework for reasoning about the control flow of sequential programs. Generalising KAT to reason about concurrent programs is not straightforward, because axioms native to KAT in conjunction…

Logic in Computer Science · Computer Science 2023-02-03 Tobias Kappé , Paul Brunet , Jurriaan Rot , Alexandra Silva , Jana Wagemaker , Fabio Zanasi

We define and study basic properties of *-continuous Kleene $\omega$-algebras that involve a *-continuous Kleene algebra with a *-continuous action on a semimodule and an infinite product operation that is also *-continuous. We show that…

Formal Languages and Automata Theory · Computer Science 2015-01-07 Zoltán Ésik , Uli Fahrenberg , Axel Legay

Guarded Kleene Algebra with Tests (GKAT) is a fragment of Kleene Algebra with Tests (KAT) that was recently introduced to reason efficiently about imperative programs. In contrast to KAT, GKAT does not have an algebraic axiomatization, but…

Logic in Computer Science · Computer Science 2024-10-02 Tobias Kappé , Todd Schmid , Alexandra Silva

In recent years, much work has been devoted to a systematic study of polynomial identities certifying strict or non-strict positivity of a polynomial on a basic closed semialgebraic set. The interest in such identities originates not least…

Commutative Algebra · Mathematics 2009-05-27 Sabine Burgdorf , Claus Scheiderer , Markus Schweighofer

The multiplicity free spaces with a one dimensional quotient were introduced by Thierry Levasseur in [11]. Recently, the author has shown that the algebra of differential operators on such spaces which are invariant under the semi-simple…

Representation Theory · Mathematics 2013-11-21 Hubert Rubenthaler

In the present paper, we introduce a multi-type calculus for the logic of measurable Kleene algebras, for which we prove soundness, completeness, conservativity, cut elimination and subformula property. Our proposal imports ideas and…

Logic · Mathematics 2018-05-22 Giuseppe Greco , Fei Liang , Alessandra Palmigiano

In this paper I consider the structure of the polylinear mapping of the free algebra over the commutative ring.

Rings and Algebras · Mathematics 2010-11-16 Aleks Kleyn

We exhibit a uniform method for obtaining (wellfounded and non-wellfounded) cut-free sequent-style proof systems that are sound and complete for various classes of action algebras, i.e., Kleene algebras enriched with meets and residuals.…

Logic in Computer Science · Computer Science 2025-01-31 Wesley Fussner , Simon Santschi , Borja Sierra Miranda

In 1992, following earlier conjectures of Lichtman and Makar-Limanov, Klein conjectured that a noncommutative domain must contain a free, multiplicative, noncyclic subsemigroup. He verified the conjecture when the center is uncountable. In…

Rings and Algebras · Mathematics 2019-04-08 Edward S. Letzter

We consider Kleene and Stone algebras defined on the completion DM(RS) of the ordered set of rough sets induced by a reflexive relation. We focus on cases where the completion forms a spatial and completely distributive lattice. We derive…

Rings and Algebras · Mathematics 2026-04-17 Jouni Järvinen , Sándor Radeleczki

Guarded Kleene Algebra with Tests (GKAT for short) is an efficient fragment of Kleene Algebra with Tests, suitable for reasoning about simple imperative while-programs. Following earlier work by Das and Pous on Kleene Algebra, we study GKAT…

Logic in Computer Science · Computer Science 2024-05-14 Jan Rooduijn , Dexter Kozen , Alexandra Silva

Kleene algebra with tests (KAT) is an equational system for program verification, which is the combination of Boolean algebra (BA) and Kleene algebra (KA), the algebra of regular expressions. In particular, KAT subsumes the propositional…

Formal Languages and Automata Theory · Computer Science 2012-10-10 Ricardo Almeida , Sabine Broda , Nelma Moreira

We introduce the two substructural propositional logics KL, KL+, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a…

Logic in Computer Science · Computer Science 2014-08-27 Christian Wurm

In the literature on Kleene algebra, a number of variants have been proposed which impose additional structure specified by a theory, such as Kleene algebra with tests (KAT) and the recent Kleene algebra with observations (KAO), or make…

Logic in Computer Science · Computer Science 2024-08-07 Damien Pous , Jurriaan Rot , Jana Wagemaker

We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…

Formal Languages and Automata Theory · Computer Science 2024-10-09 Damien Pous , Jana Wagemaker

A classical result of Sherman says that if the space of self-adjoint elements in a $C^*$-algebra $\mathcal{A}$ is a lattice with respect to its canonical order, then $\mathcal{A}$ is commutative. We give a new proof of this theorem which…

Operator Algebras · Mathematics 2020-09-04 Jochen Glück

We propose a generalisation of concurrent Kleene algebra \cite{Hoa09} that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted…

Formal Languages and Automata Theory · Computer Science 2013-01-31 Annabelle McIver , Tahiry Rabehaja , Georg Struth