zbMATH — the first resource for mathematics

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

68N25 Theory of operating systems
Full Text: DOI
[1] Apt, K.; Olderog, E., Proof rules and transformations dealing with fairness, Sci. comput. programm., 3, 65-100, (1983) · Zbl 0512.68014
[2] Darondeau, P.; Kott, L., On the observational semantics of fair parallelism, (), 147-159 · Zbl 0518.68014
[3] Darondeau, P., A fully abstract model of fair asynchrony, (), 458-465
[4] DeNicola, R.; Hennessy, M., Testing equivalences for processes, Theoret. comput. sci., 34, 83-133, (1984) · Zbl 0985.68518
[5] DeNicola, R., Testing equivalences and fully abstract models for communicating processes, ()
[6] Hennessy, M., Modelling finite delay operators, ()
[7] Hennessy, M., Synchronous and asynchronous experiments on processes, Inform. and control, 59, 2, 3, 36-83, (1983) · Zbl 0544.68028
[8] Hennessy, M., Modelling fair processes, Washington DC, Proc. 16th ACM symp. on theory of computing, 25-31, (1984)
[9] Hennessy, M., Acceptance trees, J. ACM, 32, 4, 896-928, (1985) · Zbl 0633.68074
[10] Meyer, J., Fixed points and arbitrary and fair merge of a fairly simple class of process, ()
[11] Milner, R., ()
[12] Milner, R., A finite delay operator in synchronous CCS, ()
[13] Park, D., On the semantics of fair parallelism, () · Zbl 0456.68028
[14] Stoy, M., Denotational semantics: the Scott-strachey approach to programming language theory, (1977), MIT Press Cambridge, MA
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.