Computation and Concurrency
Logic in Computer Science
2026-04-20 v7
Abstract
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.
Cite
@article{arxiv.2409.02595,
title = {Computation and Concurrency},
author = {Yong Wang},
journal= {arXiv preprint arXiv:2409.02595},
year = {2026}
}