An algebraic theory of fair asynchronous communicating processes (Q1088403): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(87)90004-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048399275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof rules and transformations dealing with fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing equivalences for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous and asynchronous experiments on processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceptance trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906397 / rank
 
Normal rank

Latest revision as of 17:42, 17 June 2024

scientific article
Language Label Description Also known as
English
An algebraic theory of fair asynchronous communicating processes
scientific article

    Statements

    An algebraic theory of fair asynchronous communicating processes (English)
    0 references
    1987
    0 references
    Cf. the review of the preliminary version [Lect. Notes Comput. Sci. 194, 260-269 (1985)] in Zbl 0566.68022.
    0 references
    fair asynchronous communicating processes
    0 references
    denotational semantics
    0 references

    Identifiers