Chapter 2: Background

Abstract

This is the chapter of the background.

Keywords

Process Algebra; True Concurrency; Localities

To make this book self-contained, we introduce some preliminaries in this chapter, including some introductions to operational semantics, proof techniques and truly concurrent process algebra [79], which is based on truly concurrent operational semantics.

2.1 Operational semantics

The semantics of ACP is based on bisimulation/rooted branching bisimulation equivalences, and the modularity of ACP relies on the concept of conservative extension. For convenience, we introduce some concepts and conclusions concerning them.

Definition 2.1

Bisimulation

A bisimulation relation R is a binary relation on processes such that: (1) if pRq

Get Truly Concurrent Process Algebra With Localities now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.