A Calculus for True Concurrency

Abstract

We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, $\tau$ laws for weakly truly concurrent bisimulations, and full congruences for strongly and weakly truly concurrent bisimulations, and also unique solution for recursion.

31 pages, 1 figures. arXiv admin note: substantial text overlap with arXiv:1611.09035

References in corpus (3)

• Algebraic Laws for True Concurrency
• Reverse Bisimulations on Stable Configuration Structures
• Weakly True Concurrency and Its Logic

Cited by in corpus (8)

• A Calculus of Truly Concurrent Mobile Processes
• Actors -- A Process Algebra Based Approach
• Truly Concurrent Process Algebra Is Reversible
• On the Parallel Composition for True Concurrency
• Reversible Truly Concurrent Process Algebra
• Truly Concurrent Process Algebra with Timing
• An Algebra of Actors Based on True Concurrency
• Verification of Patterns