Proof systems for infinite behaviours

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.

Authors

• Philippe Darondeau
• Serge Yoccoz

Keywords

No keywords are indexed for this paper.