Truly Concurrent Process Algebra With Localities

Chapter 4: CTC with localities

Abstract

This chapter is the introduction of calculus for true concurrency with localities.

Keywords

Process Algebra; True Concurrency; Localities

In this chapter, we introduce CTC with localities, including CTC with static localities in Section 4.1 and CTC with dynamic localities in Section 4.2.

4.1 CTC with static localities

4.1.1 Syntax and operational semantics

We assume an infinite set $\mathcal{N}$ of (action or event) names, and use $a,b,c,\cdots$ to range over $\mathcal{N}$. We denote by $\bar{\mathcal{N}}$ the set of co-names and let $\bar{a},\bar{b},\bar{c},\cdots$ range over $\bar{\mathcal{N}}$. Then, ...