Concurrent Kleene algebra with tests and branching automata

DOI10.1016/J.JLAMP.2015.12.005MaRDI QIDQ299205zbMATH OpenOpenAlexWikidataFDO

Authors Peter Jipsen, M. Andrew Moshier

Publication date 22 June 2016

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlamp.2015.12.005

zbMATH Keywords

concurrent Kleene algebradeterministic fork-join automataflowchart schemasKleene algebra with testsparallel programming modelspositive separation algebraseries-parallel stringsweak exchange law

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Concurrent Kleene algebra with tests
• Brzozowski goes concurrent -- a Kleene theorem for pomset languages
• Concurrent Kleene Algebra
• Concurrent Kleene algebra: free model and completeness
• Concurrent Kleene algebra and its foundations

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 3501559 (Why is no real title available?)
• scientific article; zbMATH DE number 1086671 (Why is no real title available?)
• scientific article; zbMATH DE number 1136090 (Why is no real title available?)
• scientific article; zbMATH DE number 3229496 (Why is no real title available?)
• scientific article; zbMATH DE number 2208070 (Why is no real title available?)
• A completeness theorem for Kleene algebras and the algebra of regular events
• Algebra-coalgebra duality in Brzozowski's minimization algorithm
• CONCUR 2004 - Concurrency Theory
• Concurrent Kleene Algebra
• Concurrent Kleene algebra and its foundations
• Effect algebras and unsharp quantum logics.
• Foundations of concurrent Kleene algebra
• Free shuffle algebras in language varieties
• Modeling concurrency with partial orders
• On locality and the exchange law for concurrent processes
• On the Representation of Kleene Algebras with Tests
• Series-parallel languages and the bounded-width property
• Substructural logic and partial correctness
• Synchronous Kleene algebra
• The equational theory of pomsets

Cited in

(16)

• On series-parallel pomset languages: rationality, context-freeness and automata
• Brzozowski goes concurrent -- a Kleene theorem for pomset languages
• scientific article; zbMATH DE number 7649949 (Why is no real title available?)
• Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
• scientific article; zbMATH DE number 2208070 (Why is no real title available?)
• Closure and decision properties for higher-dimensional automata
• Synchronous Kleene algebra
• Symbolic algorithms for language equivalence and Kleene algebra with tests
• Weighted synchronous automata
• An algebraic glimpse at bunched implications and separation logic
• Exploring an interface model for CKA
• Concurrent Kleene algebra with tests
• Generating Posets Beyond N
• scientific article; zbMATH DE number 7407791 (Why is no real title available?)
• scientific article; zbMATH DE number 7204945 (Why is no real title available?)
• Position Automata for Kleene Algebra with Tests

This page was built for publication: Concurrent Kleene algebra with tests and branching automata

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