A linear-history semantics for languages for distributed programming
From MaRDI portal
Publication:796298
DOI10.1016/0304-3975(84)90022-7zbMath0543.68019OpenAlexW2073981447MaRDI QIDQ796298
Amir Pnueli, Nissim Francez, Daniel J. Lehmann
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90022-7
communicationconcurrent programsCSPdenotational semanticsdeadlocksdistributed programmingcommunicating sequential processexpectation sets
Related Items
Merging regular processes by means of fixed-point theory, Infinite streams and finite observations in the semantics of uniform concurrency, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Stable families of behavioural equivalences, Compositional semantics for real-time distributed computing, Correctness of concurrent processes, Axiomatic system for proving the properties of simple multimodule programs, Communicating processes with value-passing and assignments, From algebra to operational semantics, Step failures semantics and a complete proof system, A weakest precondition semantics for communicating processes, A denotational semantics for shared-memory parallelism and nondeterminism, On the suitability of trace semantics for modular proofs of communicating processes, Specification-oriented semantics for communicating processes, Denotational semantics of CSP, A complete axiomatic semantics of spawning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantics of nondeterminism, concurrency, and communication
- A calculus of communicating systems
- A calculus of total correctness for communicating processes
- Semantics of concurrent computation. Proceedings of the international symposium, Evian, France, July 2-4, 1979
- A Theory of Communicating Sequential Processes
- Communicating sequential processes
- Processes and the denotational semantics of concurrency
