scientific article; zbMATH DE number 7649949

DOI10.4230/LIPICS.CONCUR.2019.41MaRDI QIDQ5875403FDOQ5875403

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

Title of this publication is not available (Why is that?)

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)

Cites Work

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

Cited In (4)

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

Uses Software

• NetKAT

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 Q5875403)