scientific article; zbMATH DE number 3900141

MaRDI QIDQ3678656zbMATHFDO

Authors Philippe Darondeau

Publication date 1985

zbMATH Keywords

strong fairnessCCS-like languagefair asynchrony

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• About fair asynchrony
• scientific article; zbMATH DE number 3926216
• scientific article; zbMATH DE number 3903948
• scientific article; zbMATH DE number 1231450
• Strong fairness and full abstraction for communicating processes

Cited in

(9)

• About fair asynchrony
• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
• Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay
• Full abstraction for fair testing in CCS
• Strong fairness and full abstraction for communicating processes
• scientific article; zbMATH DE number 3903948 (Why is no real title available?)
• Full abstraction for fair testing in CCS (expanded version)
• An algebraic theory of fair asynchronous communicating processes
• scientific article; zbMATH DE number 3926216 (Why is no real title available?)

This page was built for publication:

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