A complete inference system for skip-free guarded Kleene algebra with tests

DOI10.1007/978-3-031-30044-8_12MaRDI QIDQ6535242zbMATH OpenFDO

Authors Tobias Kappé, Alexandra Silva

Publication date 24 November 2023

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-30044-8_12

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 1086671
• A coalgebraic approach to Kleene algebra with tests
• A coalgebraic approach to Kleene algebra with tests
• Mathematics of Program Construction
• Concurrent Kleene algebra with tests
• On the Representation of Kleene Algebras with Tests
• A cut-free cyclic proof system for Kleene algebra
• On the coalgebraic theory of Kleene algebra with tests
• Concurrent Kleene algebra with observations: from hypotheses to completeness

Cites work

• A coalgebraic decision procedure for NetKAT
• A complete inference system for a class of regular behaviours
• A complete proof system for 1-free regular expressions modulo bisimilarity
• A completeness theorem for Kleene algebras and the algebra of regular events
• Cantor meets Scott: semantic foundations for probabilistic networks
• Completeness and incompleteness of synchronous Kleene algebra
• Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
• Concurrent Kleene algebra with observations: from hypotheses to completeness
• Concurrent Kleene algebra: free model and completeness
• Derivatives of Regular Expressions
• Functors for coalgebras
• scientific article; zbMATH DE number 1696821 (Why is no real title available?)
• scientific article; zbMATH DE number 1086671 (Why is no real title available?)
• scientific article; zbMATH DE number 7318985 (Why is no real title available?)
• scientific article; zbMATH DE number 7559476 (Why is no real title available?)
• scientific article; zbMATH DE number 233974 (Why is no real title available?)
• scientific article; zbMATH DE number 3019695 (Why is no real title available?)
• Kleene algebra with equations
• Kleene algebra with hypotheses
• Kleene algebra with observations
• Monodic Tree Kleene Algebra
• Netkat, semantic foundations for networks
• On tools for completeness of Kleene algebra with hypotheses
• PREG axiomatizer -- a ground bisimilarity checker for GSOS with predicates
• Probabilistic NetKAT
• Processes parametrised by an algebraic theory
• Sets of independent postulates for the algebra of logic.
• The Böhm–Jacopini Theorem Is False, Propositionally
• Two Complete Axiom Systems for the Algebra of Regular Events
• Universal coalgebra: A theory of systems
• Why Horn formulas matter in computer science: initial structures and generic examples

Cited in

(3)

• On propositional program equivalence (extended abstract)
• A general completeness theorem for skip-free star algebras
• A cyclic proof system for guarded Kleene algebra with tests

This page was built for publication: A complete inference system for skip-free guarded Kleene algebra with tests

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