Proof systems for infinite behaviours

https://doi.org/10.1016/0890-5401(92)90029-FGet rights and content
Under an Elsevier user license
open archive

Abstract

We 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.

Cited by (0)