LOApr 17
Computation and Concurrency
arXiv:2409.025956.11 citationsh-index: 36
Predicted impact top 77% in LO · last 90 daysOriginality Synthesis-oriented
AI Analysis
This work provides a theoretical foundation for understanding concurrency in computation, but it is incremental as it extends existing automata models.
The paper clarifies the relationship between computation and concurrency by introducing communication and additional operators into pomset automata and step automata, establishing algebras modulo language equivalence and truly concurrent bisimilarities.
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.