On an effective hierarchy of communicating processes: Separation principle and testing

DOI10.1016/S0304-3975(96)00027-8zbMath0902.68065OpenAlexW2096884898MaRDI QIDQ1269918

John Mullins

Publication date: 22 October 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00027-8

zbMATH Keywords

effective hierarchy of guaranteed processes

Mathematics Subject Classification ID

Cites Work

• Proof systems for infinite behaviours
• Fully abstract models of typed \(\lambda\)-calculi
• Separation principles in the hierarchies of classical and effective descriptive set theory
• Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item