Information and ComputationVolume 99, Issue 2, August 1992, Pages 178-191Proof systems for infinite behavioursAuthor links open overlay panelPhilippe Darondeau, Serge YoccozShow moreShareCitehttps://doi.org/10.1016/0890-5401(92)90029-FGet rights and contentUnder an Elsevier user licenseopen archiveAbstractWe introduce several generalizations of testing to ω-behaviours of communicating processes, analyse the logical complexity of the testing equivalences, and establish on that basis a connection with proof systems.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1992 Published by Elsevier Inc.