Concurrent Kleene algebra: free model and completeness

DOI10.1007/978-3-319-89884-1_30zbMath1422.68035arXiv1710.02787OpenAlexW2953186961WikidataQ60507065 ScholiaQ60507065MaRDI QIDQ2324010

Paul Brunet, Fabio Zanasi, Tobias Kappé, Alexandra Silva

Publication date: 13 September 2019

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

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (10)

A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ Generating Posets Beyond N ⋮ Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On series-parallel pomset languages: rationality, context-freeness and automata ⋮ A string diagrammatic axiomatisation of finite-state automata ⋮ Learning pomset automata ⋮ Completeness for Identity-free Kleene Lattices ⋮ Unnamed Item

This page was built for publication: Concurrent Kleene algebra: free model and completeness