A protocol for distributed cooperative work

Joseph Goguen, Grigore Rosu

Research output: Contribution to journalConference articlepeer-review


Abstract After a brief review of hidden algebra, we give behavioral specifications for set theory and closure operators, and then use these to give a behavioral specification of an abstract protocol to support distributed cooperative work structured by dependencies in such a way as to form what we call a weak closure operator. We give some correctness proofs for this protocol, and then describe a concrete instance of it, called the tatami protocol, that supports distributed cooperative proving. Finally, we draw some methodological conclusions.

Original languageEnglish (US)
Pages (from-to)3
Number of pages1
JournalElectronic Notes in Theoretical Computer Science
StatePublished - 2000
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A protocol for distributed cooperative work'. Together they form a unique fingerprint.

Cite this