TL;DR
This paper explores the relationship between computation and concurrency using pomset automata and step automata, introducing new operators and establishing algebraic frameworks for concurrency.
Contribution
It introduces communication and additional operators within pomset and step automata, establishing algebraic structures for concurrency analysis.
Findings
Established algebraic frameworks for concurrency
Introduced communication operators in pomset automata
Analyzed language equivalence and bisimilarities
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.