Kleene algebra with observations

DOI10.4230/LIPICS.CONCUR.2019.41MaRDI QIDQ5875403FDO

Authors Tobias Kappé, Paul Brunet, Jurriaan Rot, Alexandra Silva, Jana Wagemaker, Fabio Zanasi

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1811.10401

zbMATH Keywords

decision procedureconcurrent Kleene algebraKleene algebra with testsaxiomatisationfree model

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Concurrent Kleene algebra with observations: from hypotheses to completeness
• scientific article; zbMATH DE number 2090029
• Concurrent Kleene Algebra
• Concurrent Kleene algebra with tests and branching automata
• Concurrent Kleene algebra with tests

Cites work

• scientific article; zbMATH DE number 1688351 (Why is no real title available?)
• scientific article; zbMATH DE number 1696821 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 1304993 (Why is no real title available?)
• scientific article; zbMATH DE number 1086671 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• scientific article; zbMATH DE number 7204945 (Why is no real title available?)
• scientific article; zbMATH DE number 3341950 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
• A coalgebraic decision procedure for NetKAT
• A completeness theorem for Kleene algebras and the algebra of regular events
• A fast compiler for NetKAT
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Checking NFA equivalence with bisimulations up to congruence
• Complete systems of \(\mathcal B\)-rational identities
• Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
• Concurrent Kleene Algebra
• Concurrent Kleene algebra with tests and branching automata
• Concurrent Kleene algebra: free model and completeness
• Derivatives of Regular Expressions
• Developments in concurrent Kleene algebra
• Enhanced coalgebraic bisimulation
• Kleene algebra with equations
• Laws of programming
• Netkat, semantic foundations for networks
• On Hoare logic and Kleene algebra with tests
• Partial derivatives of regular expressions and finite automaton constructions
• Series-parallel languages and the bounded-width property
• Symbolic algorithms for language equivalence and Kleene algebra with tests
• The equational theory of pomsets
• Une remarque sur les systèmes complets d'identités rationnelles
• Universal coalgebra: A theory of systems

Cited in

(5)

• On tools for completeness of Kleene algebra with hypotheses
• Kleene algebra with domain
• A complete inference system for skip-free guarded Kleene algebra with tests
• Concurrent Kleene algebra with observations: from hypotheses to completeness
• On tools for completeness of Kleene algebra with hypotheses

Describes a project that uses

Uses Software

• NetKAT

This page was built for publication: Kleene algebra with observations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875403)