Proof systems for infinite behaviours

DOI10.1016/0890-5401(92)90029-FzbMath0765.03016MaRDI QIDQ1193598

Philippe Darondeau, Serge Yoccoz

Publication date: 27 September 1992

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

undecidabilitytransition systemsproof systemsdegrees\(\omega\)-logictesting equivalencesindiscernibilitylogical complexityCCS programs\(\beta\)-logic\(\omega\)-behaviours of communicating processesinfinitary testsinfinite behavioursrecursive proofs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70)

Related Items

On the logic of UNITY ⋮ Highly Undecidable Problems For Infinite Computations ⋮ On an effective hierarchy of communicating processes: Separation principle and testing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refusal testing
• Recursive \(\omega\)-rule for proof systems
• A calculus of communicating systems
• Testing equivalences for processes
• Synchronous and asynchronous experiments on processes
• Π12-logic, Part 1: Dilators
• Second order arithmetic and related topics
• Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages