Handbook of Truly Concurrent Process Algebra

Chapter 14: CTC with probability and guards

Abstract

This chapter introduces a guarded calculus for probabilistic computing in true concurrency.

Keywords

Probabilistic Computing; Calculus; Guards

In this chapter, we design the calculus CTC with probability and guards. This chapter is organized as follows. We introduce the operational semantics in Section 14.1, its syntax and operational semantics in Section 14.2, its properties for strong bisimulations in Section 14.3, and its properties for weak bisimulations in Section 14.4.

14.1 Operational semantics

Definition 14.1

Prime event structure with silent event and empty event

Let Λ be a fixed set of labels, ranged over $a,b,c,\cdots$ and $\tau ,ϵ$. A (Λ-labeled) prime event structure with silent event τ and empty event ...