Infinitary parallelism without unbounded nondeterminism in CSP
Abstract The theory of CSP is extended to include an infinitary parallel composition operator. The presence of such an operator allows us to write programs where infinitely many agents compute concurrently. We show that this operator can be modelled within the failures-divergences model of Brookes a...
|Published in:||Acta informatica, Vol. 30 (1993), p. 467-487|
|Other Involved Persons:||;|
|Item Description:||Copyright: Copyright 1993 Springer-Verlag|
|QR Code:||Show QR Code|