Get full access to Truly Concurrent Process Algebra With Localities and 60K+ other titles, with a free 10-day trial of O'Reilly.

There are also live events, courses curated by job role, and more.

Start your free trial

Chapter 16: CTC with localities and guards

Abstract

This chapter introduces a calculus for true concurrency with localities and gurds.

Keywords

Process Algebra; True Concurrency; Localities; Reversibility

In this chapter, we introduce CTC with localities and guards, including CTC with static localities and guards in Section 16.1, CTC with dynamic localities and guards in Section 16.2.

16.1 CTC with static localities and guards

16.1.1 Syntax and operational semantics

We assume an infinite set $N$ of (action or event) names, and use $a, b, c, \dots$ to range over $N$

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.

Start your free trial

Don’t leave empty-handed

Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.

It’s yours, free.

Get it now

Check it out now on O’Reilly

Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.

Start your free trial Become a member now