加载中…
We try to clarify the relationship between computation and concurrency. Base on the so-called pomsetc automata and step automata, we introduce communication and more operators, and establish the algebras modulo language equivalence and truly concurrent bisimilarities.

生成讲解博客的中文版本

生成AI智能校验的中文版本