On the public citation graph

On kleene algebras and closed semirings

0 signed · 154 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1994.1037openalex-snapshot

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

inferredcites →https://doi.org/10.1007/3-540-09237-4openalex-snapshot

First-Order Dynamic Logic

inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot

On observing nondeterminism and concurrency

inferredcites →https://doi.org/10.1007/3-540-18088-5_17openalex-snapshot

The kleene and the Parikh Theorem in complete semirings

inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot

Categories for the Working Mathematician

inferredcites →https://doi.org/10.1007/978-3-642-69897-2openalex-snapshot

Data Structures and Algorithms 2

inferredcites →https://doi.org/10.1007/bfb0025782openalex-snapshot

On induction vs. *-continuity

inferredcites →https://doi.org/10.1007/bfb0043079openalex-snapshot

Dynamic algebras as a well-behaved fragment of relation algebras

inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot

Semantical consideration on floyo-hoare logic

inferredcites →https://doi.org/10.1145/321312.321326openalex-snapshot

Two Complete Axiom Systems for the Algebra of Regular Events

inferredcites →https://doi.org/10.1145/800141.804649openalex-snapshot

Dynamic algebras and the nature of induction

inferredcites →https://doi.org/10.2307/2273958openalex-snapshot

Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs.…

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1994.1037openalex-snapshot

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

inferred← citeshttps://doi.org/10.1006/inco.2000.2889openalex-snapshot

On Equations for Union-Free Regular Languages

inferred← citeshttps://doi.org/10.1006/inco.2001.2960openalex-snapshot

On the Complexity of Reasoning in Kleene Algebra

inferred← citeshttps://doi.org/10.1007/1-4020-3532-2_10openalex-snapshot

Computation Orchestration

inferred← citeshttps://doi.org/10.1007/1-4020-3532-2_11openalex-snapshot

A Tree Semantics of an Orchestration Language

inferred← citeshttps://doi.org/10.1007/11734673_8openalex-snapshot

A Framework for Kleene Algebra with an Embedded Structure

inferred← citeshttps://doi.org/10.1007/11817949_32openalex-snapshot

A Language for Task Orchestration and Its Semantic Properties

inferred← citeshttps://doi.org/10.1007/11828563_7openalex-snapshot

On the Complexity of the Equational Theory of Relational Action Algebras

inferred← citeshttps://doi.org/10.1007/3-540-61042-1_35openalex-snapshot

Kleene algebra with tests and commutativity conditions

inferred← citeshttps://doi.org/10.1007/3-540-63172-0_43openalex-snapshot

Kleene algebra with tests: Completeness and decidability

inferred← citeshttps://doi.org/10.1007/978-3-030-02149-8_13openalex-snapshot

Calculational Verification of Reactive Programs with Reactive Relations and Kleene Algebra

inferred← citeshttps://doi.org/10.1007/978-3-030-02149-8_3openalex-snapshot

Coequalizers and Tensor Products for Continuous Idempotent Semirings

inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_14openalex-snapshot

Embedding Kozen-Tiuryn Logic into Residuated One-Sorted Kleene Algebra with Tests

inferred← citeshttps://doi.org/10.1007/978-3-031-26622-5_3openalex-snapshot

Relating Kleene Algebras with Pseudo Uninorms

inferred← citeshttps://doi.org/10.1007/978-3-031-28083-2_13openalex-snapshot

On the Complexity of Kleene Algebra with Domain

inferred← citeshttps://doi.org/10.1007/978-3-031-43345-0_5openalex-snapshot

Shades of Iteration: From Elgot to Kleene

inferred← citeshttps://doi.org/10.1007/978-3-031-51777-8_4openalex-snapshot

Kleene Algebra of Weighted Programs with Domain

inferred← citeshttps://doi.org/10.1007/978-3-032-22469-9_17openalex-snapshot

Morita Rigidity for Kleene Algebras

inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_9openalex-snapshot

Kleene Algebras and Semimodules for Energy Problems

inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_18openalex-snapshot

Efficient Program Transformers for Translating LCC to PDL

inferred← citeshttps://doi.org/10.1007/978-3-319-14675-1_4openalex-snapshot

Graph Problems and Vector-Matrix Multiplications in Haskell

inferred← citeshttps://doi.org/10.1007/978-3-319-21500-6_19openalex-snapshot

*-Continuous Kleene $$\omega $$-Algebras

inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_15openalex-snapshot

Forkable Regular Expressions

inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_11openalex-snapshot

The Categories of Kleene Algebras, Action Algebras and Action Lattices Are Related by Adjunctions

inferred← citeshttps://doi.org/10.1007/978-3-540-30204-9_4openalex-snapshot

Reasoning About Web Information Systems Using Story Algebras

inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_16openalex-snapshot

How the Location of * Influences Complexity in Kleene Algebra with Tests

inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_26openalex-snapshot

On Fixed Point Equations over Commutative Semirings

inferred← citeshttps://doi.org/10.1007/978-3-540-71200-8_6openalex-snapshot

Data Preparation for Data Mining in Medical Data Sets

inferred← citeshttps://doi.org/10.1007/978-3-540-72952-5_11openalex-snapshot

A Formal Language for Electronic Contracts

inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_34openalex-snapshot

Certified Size-Change Termination

inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_13openalex-snapshot

The Algebraic Approach I: The Algebraization of the Chomsky Hierarchy

inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_14openalex-snapshot

The Algebraic Approach II: Dioids, Quantales and Monads

inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_22openalex-snapshot

Solving Linear Equations in *-continuous Action Lattices

inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_2openalex-snapshot

Fixed Point Theory

inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_9openalex-snapshot

∗-Continuous Idempotent Left Semirings and Their Ideal Completion

inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_5openalex-snapshot

Reasoning about Loops in Total and General Correctness

inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_19openalex-snapshot

Omega Algebras and Regular Equations

inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_20openalex-snapshot

On Probabilistic Kleene Algebras, Automata and Simulations

inferred← citeshttps://doi.org/10.1007/978-3-642-27269-1_14openalex-snapshot

Decomposition of Constraint Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_5openalex-snapshot

Automated Reasoning in Higher-Order Regular Algebra

inferred← citeshttps://doi.org/10.1007/978-3-662-62798-3_4openalex-snapshot

A Study of Algebras and Logics of Rough Sets Based on Classical and Generalized Approximation Spaces

inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_6openalex-snapshot

A Survey of Boolean Algebras with Operators

inferred← citeshttps://doi.org/10.1007/bf00370684openalex-snapshot

Algebraization of quantifier logics, an introductory overview

inferred← citeshttps://doi.org/10.1007/bfb0018436openalex-snapshot

Action logic and pure induction

inferred← citeshttps://doi.org/10.1007/bfb0023771openalex-snapshot

Towards Kleene Algebra with recursion

inferred← citeshttps://doi.org/10.1007/s00012-008-2084-yopenalex-snapshot

A class of inherently nonfinitely based semirings

inferred← citeshttps://doi.org/10.1007/s00165-009-0111-1openalex-snapshot

Refinement algebra for probabilistic programs

inferred← citeshttps://doi.org/10.1007/s00500-008-0384-yopenalex-snapshot

Inductive semimodules and the vector modules over them

inferred← citeshttps://doi.org/10.1007/s10270-006-0012-1openalex-snapshot

Computation Orchestration

inferred← citeshttps://doi.org/10.1007/s10817-014-9318-9openalex-snapshot

On the Fine-Structure of Regular Algebra

inferred← citeshttps://doi.org/10.1007/s10849-025-09447-7openalex-snapshot

Deontic Action Logics: A Modular Algebraic Perspective

inferred← citeshttps://doi.org/10.1007/s10992-010-9134-6openalex-snapshot

Contradictory Information: Too Much of a Good Thing

inferred← citeshttps://doi.org/10.1007/s11225-008-9116-7openalex-snapshot

Infinitary Action Logic: Complexity, Models and Grammars

inferred← citeshttps://doi.org/10.1007/s11225-013-9473-8openalex-snapshot

On the Dynamic Logic of Agency and Action

inferred← citeshttps://doi.org/10.1007/s11225-016-9670-3openalex-snapshot

A New View of Effects in a Hilbert Space

inferred← citeshttps://doi.org/10.1007/s11225-016-9689-5openalex-snapshot

On Paraconsistent Weak Kleene Logic: Axiomatisation and Algebraic Analysis

inferred← citeshttps://doi.org/10.1016/j.datak.2004.08.005openalex-snapshot

Conceptual modelling of web information systems

inferred← citeshttps://doi.org/10.1016/j.entcs.2020.02.004openalex-snapshot

Introducing Synchrony in Fuzzy Automata

inferred← citeshttps://doi.org/10.1016/j.ic.2009.02.003openalex-snapshot

Axiomatizing rational power series over natural numbers

inferred← citeshttps://doi.org/10.1016/j.ins.2007.05.019openalex-snapshot

On ∗–λ-semirings

inferred← citeshttps://doi.org/10.1016/j.ipl.2009.06.003openalex-snapshot

Graphical models of separation logic

inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100681openalex-snapshot

Automated verification of reactive and concurrent programs by calculation

inferred← citeshttps://doi.org/10.1016/j.jlap.2009.07.002openalex-snapshot

Normal design algebra

inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.009openalex-snapshot

Synchronous Kleene algebra

inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.016openalex-snapshot

Algebraic notions of nontermination: Omega and divergence in idempotent semirings

inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.019openalex-snapshot

Axiomatizability of representable domain algebras

inferred← citeshttps://doi.org/10.1016/j.jlap.2012.05.002openalex-snapshot

Typing theorems of omega algebra

inferred← citeshttps://doi.org/10.1016/j.jlap.2012.05.004openalex-snapshot

Left omega algebras and regular equations

inferred← citeshttps://doi.org/10.1016/j.jlap.2013.01.001openalex-snapshot

Free inductive K-semialgebras

inferred← citeshttps://doi.org/10.1016/j.jlap.2014.02.001openalex-snapshot

Programming and automating mathematics in the Tarski–Kleene hierarchy

inferred← citeshttps://doi.org/10.1016/j.jlap.2014.02.009openalex-snapshot

Hopscotch—reaching the target hop by hop

inferred← citeshttps://doi.org/10.1016/j.mbs.2013.02.012openalex-snapshot

Metabolic isotopomer labeling systems. Part III: Path tracing

inferred← citeshttps://doi.org/10.1016/j.scico.2013.07.005openalex-snapshot

A verified algebra for read–write Linked Data

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.050openalex-snapshot

Inductive ∗-semirings

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.069openalex-snapshot

Algebras of modal operators and partial correctness

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.037openalex-snapshot

A timed semantics of Orc

inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00027-4openalex-snapshot

Complexity of equations valid in algebras of relations part I: Strong non-finitizability

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00412-7openalex-snapshot

On the equational definition of the least prefixed point

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00248-4openalex-snapshot

The equational logic of fixed points

inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80016-7openalex-snapshot

Semirings and Semifields

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80561-9openalex-snapshot

Induction, Coinduction, and Adjoints

inferred← citeshttps://doi.org/10.1017/s0960129515000262openalex-snapshot

Many-one reductions and the category of multivalued functions

inferred← citeshttps://doi.org/10.1017/s0960129522000329openalex-snapshot

An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem

inferred← citeshttps://doi.org/10.1017/s0960129522000421openalex-snapshot

Weighted synchronous automata

inferred← citeshttps://doi.org/10.1051/ita/1995290605151openalex-snapshot

Une condition impliquant toutes les identités rationnelles

inferred← citeshttps://doi.org/10.1093/logcom/exl036openalex-snapshot

On Action Logic: Equational Theories of Action Algebras

inferred← citeshttps://doi.org/10.1109/aswec.2006.36openalex-snapshot

Model-based runtime analysis of distributed reactive systems

inferred← citeshttps://doi.org/10.1109/formalise.2017.2openalex-snapshot

Featured Weighted Automata

inferred← citeshttps://doi.org/10.1109/ismvl.2009.45openalex-snapshot

Multiple Valued Logic Algebra for the Synthesis of Digital Circuits

inferred← citeshttps://doi.org/10.1109/ismvl57333.2023.00031openalex-snapshot

Kleene Algebra With Tests for Weighted Programs

inferred← citeshttps://doi.org/10.1109/lics.1991.151646openalex-snapshot

A completeness theorem for Kleene algebras and the algebra of regular events

inferred← citeshttps://doi.org/10.1109/lics.1997.614947openalex-snapshot

On the complexity of reasoning in Kleene algebra

inferred← citeshttps://doi.org/10.1109/lics.2019.8785659openalex-snapshot

The Logic of Action Lattices is Undecidable

inferred← citeshttps://doi.org/10.1111/j.1467-8640.2011.00387.xopenalex-snapshot

PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST‐CLASS AGENT INTERACTION PROTOCOLS

inferred← citeshttps://doi.org/10.1145/1857914.1857917openalex-snapshot

Newtonian program analysis

inferred← citeshttps://doi.org/10.1145/1863543.1863585openalex-snapshot

Total parser combinators

inferred← citeshttps://doi.org/10.1145/256167.256195openalex-snapshot

Kleene algebra with tests

inferred← citeshttps://doi.org/10.1145/3314221.3314585openalex-snapshot

Argosy: verifying layered storage systems with recovery refinement

inferred← citeshttps://doi.org/10.1145/3314221.3314625openalex-snapshot

A typed, algebraic approach to parsing

inferred← citeshttps://doi.org/10.1145/3360604openalex-snapshot

Specification and inference of trace refinement relations

inferred← citeshttps://doi.org/10.1145/3445810openalex-snapshot

Action Logic is Undecidable

inferred← citeshttps://doi.org/10.1145/3622868openalex-snapshot

Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis

inferred← citeshttps://doi.org/10.1145/3704901openalex-snapshot

An Incremental Algorithm for Algebraic Program Analysis

inferred← citeshttps://doi.org/10.1201/b16416-10openalex-snapshot

Models, Sheaves, and Topos

inferred← citeshttps://doi.org/10.1201/b16416-12openalex-snapshot

Filters and Ultraproducts on Projective Sets

inferred← citeshttps://doi.org/10.1201/b21197-3openalex-snapshot

Computing Categories, Language Fragments, and Models

inferred← citeshttps://doi.org/10.14232/actacyb.23.1.2017.13openalex-snapshot

An Algebraic Approach to Energy Problems I — *-Continuous Kleene ω-Algebras

inferred← citeshttps://doi.org/10.14232/actacyb.23.1.2017.14openalex-snapshot

An Algebraic Approach to Energy Problems II — The Algebra of Energy Functions

inferred← citeshttps://doi.org/10.1504/ijaose.2007.016268openalex-snapshot

A formal semantics for Gaia liveness rules and expressions

inferred← citeshttps://doi.org/10.18725/oparu-895openalex-snapshot

Algebraic foundations of the Unifying Theories of Programming

inferred← citeshttps://doi.org/10.2168/lmcs-11(2:14)2015openalex-snapshot

Weak bisimulation for coalgebras over order enriched monads

inferred← citeshttps://doi.org/10.2168/lmcs-9(2:2)2013openalex-snapshot

The degree structure of Weihrauch-reducibility

inferred← citeshttps://doi.org/10.22028/d291-26012openalex-snapshot

On the formal foundation of a verification approach for system-level concurrent programs

inferred← citeshttps://doi.org/10.22152/programming-journal.org/2023/7/6openalex-snapshot

A Theory of Composing Protocols

inferred← citeshttps://doi.org/10.2298/csis0802137popenalex-snapshot

KAT and PHL in Coq

inferred← citeshttps://doi.org/10.23638/lmcs-15(2:17)2019openalex-snapshot

An $\omega$-Algebra for Real-Time Energy Problems

inferred← citeshttps://doi.org/10.23638/lmcs-15(4:4)2019openalex-snapshot

On Free $\omega$-Continuous and Regular Ordered Algebras

inferred← citeshttps://doi.org/10.2478/forma-2018-0002openalex-snapshot

Kleene Algebra of Partial Predicates

inferred← citeshttps://doi.org/10.25949/19430699openalex-snapshot

Algebraic verification of probabilistic and concurrent systems

inferred← citeshttps://doi.org/10.3156/jsoft.16.184openalex-snapshot

Complete and Independent Sets of Axioms of Kleene Algebra

inferred← citeshttps://doi.org/10.3233/fun-2007-78206openalex-snapshot

An Infinitary Sequent System for the Equational Theory of *-continuous Action Lattices

inferred← citeshttps://doi.org/10.3390/a15030090openalex-snapshot

Kleene Algebra to Compute Invariant Sets of Dynamical Systems

inferred← citeshttps://doi.org/10.4067/s0718-33052020000300540openalex-snapshot

Four stage pipeline quaternary processor

inferred← citeshttps://doi.org/10.4204/eptcs.161.7openalex-snapshot

Kleene Algebras, Regular Languages and Substructural Logics

inferred← citeshttps://doi.org/10.4204/eptcs.191.6openalex-snapshot

*-Continuous Kleene ω-Algebras for Energy Problems

inferred← citeshttps://doi.org/10.4204/eptcs.58.2openalex-snapshot

A Verified Algebra for Linked Data

inferred← citeshttps://doi.org/10.4213/im9480openalex-snapshot

Алгоритмическая сложность теорий коммутативных алгебр Клини

inferred← citeshttps://doi.org/10.4213/im9480eopenalex-snapshot

Algorithmic complexity for theories of commutative Kleene algebras

inferred← citeshttps://doi.org/10.4213/rm10268openalex-snapshot

Алгоритмическая сложность теорий с итерацией Клини

inferred← citeshttps://doi.org/10.4213/rm10268eopenalex-snapshot

Algorithmic complexity of theories with Kleene iteration

inferred← citeshttps://doi.org/10.4230/lipics.csl.2013.415openalex-snapshot

Kleene Algebra with Products and Iteration Theories

inferred← citeshttps://doi.org/10.48550/arxiv.1009.4820openalex-snapshot

Free inductive K-semialgebras

inferred← citeshttps://doi.org/10.48550/arxiv.1307.0635openalex-snapshot

Kleene Algebras and Semimodules for Energy Problems

inferred← citeshttps://doi.org/10.48550/arxiv.1510.07293openalex-snapshot

Forkable Regular Expressions

inferred← citeshttps://doi.org/10.48550/arxiv.1903.07213openalex-snapshot

Specification and Inference of Trace Refinement Relations

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0501032openalex-snapshot

On Partially Additive Kleene Algebras

inferred← citeshttps://doi.org/10.5109/1434308openalex-snapshot

REMARKS ON IDEAL COMPLETION OF *-CONTINUOUS IDEMPOTENT LEFT SEMIRINGS

inferred← citeshttps://doi.org/10.5555/1838206.1838363openalex-snapshot

Characterising and matching iterative and recursive agent interaction protocols

inferred← citeshttps://doi.org/10.5555/3101290.3101304openalex-snapshot

Featured weighted automata

inferred← citeshttps://doi.org/10.70675/eee6d28dzf1b2z4719z9254zac9f957232c6openalex-snapshot

The semiring-based provenance framework for graph databases

inferred← citeshttps://doi.org/10.7146/brics.v7i27.20158openalex-snapshot

Inductive * -Semirings

inferred← citeshttps://doi.org/10.7146/dpb.v21i381.6613openalex-snapshot

On Action Algebras

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.