Concurrent Kleene algebra with tests and branching automata
详细信息 查看全文
- 作者：Peter Jipsen ; jipsen@chapman.edu" class="auth_mail" title="E-mail the corresponding author ; M. Andrew Moshier moshier@chapman.edu" class="auth_mail" title="E-mail the corresponding author
- 关键词：Concurrent Kleene algebra ; Kleene algebra with tests ; Parallel programming models ; Deterministic fork-join automata ; Series-parallel strings ; Weak exchange law ; Positive separation algebra ; Flowchart schemas
- 刊名：Journal of Logical and Algebraic Methods in Programming
- 出版年：2016
- 出版时间：June 2016
- 年：2016
- 卷：85
- 期：4
- 页码：637-652
- 全文大小：654 K
文摘
- •
Guarded series-parallel strings generalize guarded strings, giving a language model for concurrent Kleene algebra with tests.
- •
The guarded series-parallel string model satisfies the weak exchange law.
- •
We define a simpler type of branching automata proving that the fork-regular and series-rational languages coincide.
- •
We define concurrent deterministic flowchart schemes and relate them to concurrent Kleene algebras with tests.
- •
A purely relational CKAT model is defined based on binary relations over a positive separation algebra.