A linear history semantics for distributed languages extended abstract
- 1 October 1980
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A denotational semantics is given for a distributed language based on communication (CSP). The semantics uses linear sequences of communications to record computations; for any well formed program segment the semantics is a relation between attainable states and the communication sequences needed to attain these states. In binding two or more processes we match and merge the communication sequences assumed by each process to obtain a sequence and State of the combined process. The approach taken here is distinguished by relatively simple semantic domains and ordering.Keywords
This publication has 5 references indexed in Scilit:
- Denotational semantics of parallelismPublished by Springer Nature ,2005
- Semantics of nondeterminism, concurrency, and communicationJournal of Computer and System Sciences, 1979
- Concurrent Processes and Their SyntaxJournal of the ACM, 1979
- The Denotational Description of Programming LanguagesPublished by Springer Nature ,1979
- Communicating sequential processesCommunications of the ACM, 1978