A protocol for distributed cooperative work

Joseph Goguen; Grigore Rosu

doi:10.1016/S1571-0661(05)80625-5

A protocol for distributed cooperative work

Research output: Contribution to journal › Conference article › peer-review

Abstract

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 language	English (US)
Pages (from-to)	3
Number of pages	1
Journal	Electronic Notes in Theoretical Computer Science
Volume	28
DOIs	https://doi.org/10.1016/S1571-0661(05)80625-5
State	Published - 2000
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/S1571-0661(05)80625-5

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

Cite this

@article{5ffa86b98972462095d316407e5bbd6a,

title = "A protocol for distributed cooperative work",

abstract = "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.",

author = "Joseph Goguen and Grigore Rosu",

year = "2000",

doi = "10.1016/S1571-0661(05)80625-5",

language = "English (US)",

volume = "28",

pages = "3",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

}

TY - JOUR

T1 - A protocol for distributed cooperative work

AU - Goguen, Joseph

AU - Rosu, Grigore

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=19044391992&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=19044391992&partnerID=8YFLogxK

U2 - 10.1016/S1571-0661(05)80625-5

DO - 10.1016/S1571-0661(05)80625-5

M3 - Conference article

AN - SCOPUS:19044391992

VL - 28

SP - 3

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

ER -