scientific article; zbMATH DE number 3900141

zbMATH Open0564.68018MaRDI QIDQ3678656FDOQ3678656

Authors: Philippe Darondeau 

Publication date: 1985

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

strong fairnessCCS-like languagefair asynchrony

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited In (9)

• Strong fairness and full abstraction for communicating processes
• An algebraic theory of fair asynchronous communicating processes
• Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay
• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
• Full abstraction for fair testing in CCS (expanded version)
• Full abstraction for fair testing in CCS
• Title not available (Why is that?)
• Title not available (Why is that?)
• About fair asynchrony

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)