Concurrent Kleene algebra with tests and branching automata
DOI10.1016/J.JLAMP.2015.12.005zbMath1344.68083OpenAlexW2236738605WikidataQ114851584 ScholiaQ114851584MaRDI QIDQ299205
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
concurrent Kleene algebradeterministic fork-join automataflowchart schemasKleene algebra with testsparallel programming modelspositive separation algebraseries-parallel stringsweak exchange law
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) 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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (8)
Cites Work
- Effect algebras and unsharp quantum logics.
- Concurrent Kleene algebra and its foundations
- Free shuffle algebras in language varieties
- Synchronous Kleene algebra
- Modeling concurrency with partial orders
- The equational theory of pomsets
- A completeness theorem for Kleene algebras and the algebra of regular events
- Series-parallel languages and the bounded-width property
- On Locality and the Exchange Law for Concurrent Processes
- Concurrent Kleene Algebra
- Foundations of Concurrent Kleene Algebra
- Substructural logic and partial correctness
- CONCUR 2004 - Concurrency Theory
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- On the Representation of Kleene Algebras with Tests
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Concurrent Kleene algebra with tests and branching automata