A new strategy for proving ω-completeness applied to process algebra
- 16 June 2005
- book chapter
- Published by Springer Nature
- p. 314-331
- https://doi.org/10.1007/bfb0039068
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Tools for proving inductive equalities, relative completeness, and ω-completenessInformation and Computation, 1990
- The linear time - branching time spectrumPublished by Springer Nature ,1990
- Axiomatising Finite Concurrent ProcessesSIAM Journal on Computing, 1988
- Proof by consistencyArtificial Intelligence, 1987
- Partial evaluation and ω-completeness of algebraic specificationsTheoretical Computer Science, 1986
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980
- On proving inductive properties of abstract data typesPublished by Association for Computing Machinery (ACM) ,1980