Proof systems for infinite behaviours

DOI10.1016/0890-5401(92)90029-FMaRDI QIDQ1193598zbMATH OpenFDO

Authors Philippe Darondeau, Serge Yoccoz

Publication date 27 September 1992

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

zbMATH Keywords

transition systemstesting equivalencesundecidabilitydegreesindiscernibilityproof systemslogical complexityCCS programs\(\beta\)-logic\(\omega\)-behaviours of communicating processes\(\omega\)-logicinfinitary testsinfinite behavioursrecursive proofs

Mathematics Subject Classification ID

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

Recommendations

• Testing equivalences for processes
• Proof systems for message-passing process algebras
• CCS expressions, finite state processes, and three problems of equivalence
• scientific article; zbMATH DE number 1223723
• scientific article; zbMATH DE number 3928330

Cites work

• scientific article; zbMATH DE number 4033738 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3556029 (Why is no real title available?)
• scientific article; zbMATH DE number 3572138 (Why is no real title available?)
• scientific article; zbMATH DE number 3995044 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A calculus of communicating systems
• Descriptive set theory
• Recursive \(\omega\)-rule for proof systems
• Refusal testing
• Second order arithmetic and related topics
• Synchronous and asynchronous experiments on processes
• Testing equivalences for processes
• Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
• Π12-logic, Part 1: Dilators

Cited in

(9)

• scientific article; zbMATH DE number 3600027 (Why is no real title available?)
• scientific article; zbMATH DE number 4199644 (Why is no real title available?)
• On an effective hierarchy of communicating processes: Separation principle and testing
• Proving infinitary formulas
• Highly Undecidable Problems For Infinite Computations
• scientific article; zbMATH DE number 7238899 (Why is no real title available?)
• scientific article; zbMATH DE number 1534491 (Why is no real title available?)
• An equational characterisation of the must testing pre-order for regular processes
• On the logic of UNITY

This page was built for publication: Proof systems for infinite behaviours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193598)