A proof system for communicating processes with value-passing (Q1179808): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4144755 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acceptance trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3997501 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3355228 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Communicating sequential processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3777424 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The laws of Occam programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A calculus of communicating systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992568 / rank | |||
Normal rank |
Latest revision as of 14:09, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A proof system for communicating processes with value-passing |
scientific article |
Statements
A proof system for communicating processes with value-passing (English)
0 references
27 June 1992
0 references
The language studied is essentially the original value-passing version of CCS except that \(\tau\) is replaced by versions of the internal and external choice operators from TCSP. The reasonings about data and about processes are dissociated. The main proof system is used for the reasoning about processes. For the reasoning about data a subsidiary proof system would be used or called by the main one. In the denotational model the input expression c?x.p is represented as a function mapping data-values to semantic objects. The main system is shown to be sound and complete for finite processes with respect to a denotational semantics based on Acceptance Trees.
0 references
algebraic laws
0 references
completeness
0 references
value-passing
0 references
CCS
0 references
proof system
0 references