Algebraic Laws for True Concurrency

Abstract

We find the algebraic laws for true concurrency. Eventually, we establish a whole axiomatization for true concurrency called APTC (Algebra for Parallelism in True Concurrency). The theory APTC has four modules: BATC (Basic Algebra for True Concurrency), APTC (Algebra for Parallelism in True Concurrency), recursion and abstraction. And also, we show the applications and extensions of APTC.

arXiv comment110 pages, 3 figures, 48 tables

References in corpus (3)

• A Logic with Reverse Modalities for History-preserving Bisimulations
• Reverse Bisimulations on Stable Configuration Structures
• Weakly True Concurrency and Its Logic

Cited by in corpus (13)

• A Calculus for True Concurrency
• A Calculus of Truly Concurrent Mobile Processes
• Actors -- A Process Algebra Based Approach
• Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing
• Truly Concurrent Process Algebra Is Reversible
• Truly Concurrent Process Algebra with Timing
• An Algebra of Actors Based on True Concurrency
• Truly Concurrent Bisimilarities are Game Equivalent
• Reversible Quantum Process Algebra with Guards
• On the Parallel Composition for True Concurrency
• Secure Process Algebra
• Verification of Patterns
• Relation of Web Service Orchestration, Abstract Process, Web Service and Choreography