Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  introduce concurrent Kleene algebra with tests (CKAT) as a combination of Kleene algebra with tests (KAT) of Kozen and Smith with concurrent Kleene algebras (CKA), introduced by Hoare, Moller, Struth and hrman. CKAT provides a relatively simple algebraic model for reasoning about semantics of concurrent programs.  generalize guarded strings to guarded series-parallel strings  , or gsp-strings, to give a concrete language model for CKAT. Combining nondeterministic guarded automata of Kozen with branching automata of Lodaya and il one obtains a model for processing gsp-strings in parallel. To ensure that the model satisfies the ak exchange law (x‖y)(z‖w)≤(xz)‖(yw)(x‖y)(z‖w)≤(xz)‖(yw) of CKA,  make use of the subsumption order of Gischer on the gsp-strings.  also define deterministic branching automata and investigate their relation to (nondeterministic) branching automata.#R##N##R##N#To express basic concurrent algorithms,  define concurrent deterministic flowchart schemas and relate them to branching automata and to concurrent Kleene algebras with tests.
['Peter Jipsen', 'M. Andrew Moshier']
I am writing a research paper on a idea Concurrent Kleene Algebra with Tests and Branching Automata
[{"from": "human", "value": "I am writing a research paper on a idea Concurrent Kleene Algebra with Tests and Branching Automata"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  introduce concurrent Kleene algebra with tests (CKAT) as a combination of Kleene algebra with tests (KAT) of Kozen and Smith with concurrent Kleene algebras (CKA), introduced by Hoare, Moller, Struth and hrman. CKAT provides a relatively simple algebraic model for reasoning about semantics of concurrent programs.  generalize guarded strings to guarded series-parallel strings \u00a0, or gsp-strings, to give a concrete language model for CKAT. Combining nondeterministic guarded automata of Kozen with branching automata of Lodaya and il one obtains a model for processing gsp-strings in parallel. To ensure that the model satisfies the ak exchange law (x\u2016y)(z\u2016w)\u2264(xz)\u2016(yw)(x\u2016y)(z\u2016w)\u2264(xz)\u2016(yw) of CKA,  make use of the subsumption order of Gischer on the gsp-strings.  also define deterministic branching automata and investigate their relation to (nondeterministic) branching automata.#R##N##R##N#To express basic concurrent algorithms,  define concurrent deterministic flowchart schemas and relate them to branching automata and to concurrent Kleene algebras with tests."}]