Synchronous Calculus of Communicating Systems

  • David Gray
Part of the Applied Computing book series (APPLCOMP)


Asynchronous algebras such as CCS can help us to understand and correctly design concurrent systems by viewing them as collections of concurrently operating sequential subsystems; the behaviour of each subsystem is defined in terms of sequences of atomic actions, internal ones to progress a subsystem’s local task and external ones for subsystem interaction. By formalising such a view, the calculus predicts the behaviour of a composition from knowledge of the behaviours of its individual parts. But, being an asynchronous algebra, it is constrained to express system behaviours in terms of sequences of actions, independent of time, and cannot directly address real-time systems. On the other hand, synchronous algebras (which, by definition, contain a concept of global time - events only happen when some omnipresent clock ticks) define not only the order of actions but also when they occur.


Time Slot Internal Action Mutual Exclusion Formal Design Derivation Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 1999

Authors and Affiliations

  • David Gray

There are no affiliations available

Personalised recommendations