pith. machine review for the scientific record. sign in

arxiv: 2409.02595 · v7 · submitted 2024-09-04 · 💻 cs.LO

Recognition: unknown

Computation and Concurrency

Yong Wang
Authors on Pith no claims yet
classification 💻 cs.LO
keywords automatacomputationconcurrencyalgebrasbasebisimilaritiesclarifycommunication
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Finitary Truly Concurrent Bisimulations

    cs.LO 2026-05 unverdicted novelty 4.0

    Defines finitary versions of truly concurrent prebisimulations following the behavioural form to enable full abstraction in denotational semantics of concurrent processes.