On the consistency of Koomen's Fair Abstraction Rule
Open Access
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 51 (1-2), 129-176
- https://doi.org/10.1016/0304-3975(87)90052-1
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Merging regular processes by means of fixed-point theoryTheoretical Computer Science, 1986
- Top-down design and the algebra of communicating processesScience of Computer Programming, 1985
- Algebraic specification and verification of communication protocolsScience of Computer Programming, 1985
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- Axiomatising finite delay operatorsActa Informatica, 1984