Concurrent Kleene algebra with tests and branching automata
DOI10.1016/J.JLAMP.2015.12.005zbMATH Open1344.68083OpenAlexW2236738605WikidataQ114851584 ScholiaQ114851584MaRDI QIDQ299205FDOQ299205
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
Recommendations
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) 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)
Cites Work
- Title not available (Why is that?)
- Substructural logic and partial correctness
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- Effect algebras and unsharp quantum logics.
- Modeling concurrency with partial orders
- Title not available (Why is that?)
- CONCUR 2004 - Concurrency Theory
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concurrent Kleene algebra and its foundations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Representation of Kleene Algebras with Tests
- Free shuffle algebras in language varieties
- Synchronous Kleene algebra
Cited In (13)
- On series-parallel pomset languages: rationality, context-freeness and automata
- Title not available (Why is that?)
- Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
- Title not available (Why is that?)
- Closure and decision properties for higher-dimensional automata
- Symbolic algorithms for language equivalence and Kleene algebra with tests
- Weighted synchronous automata
- An algebraic glimpse at bunched implications and separation logic
- Generating Posets Beyond N
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
