Relations in Concurrency Export

@inproceedings{citeulike:3564528, abstract = {The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated via spans of event structures, and the semantics of nondeterministic dataflow. Profunctors are shown to play a key role in relating models for concurrency and to support an interpretation as higher-order processes (where input and output may be processes). Two recent directions of research are described. One is concerned with a language and computational interpretation for profunctors. This addresses the duality between input and output in profunctors. The other is to investigate general spans of event structures(the spans can be viewed as special profunctors) to give causalsemantics to higher-order processes. For this it is useful to generalise event structures to allow events which "persist."}, address = {Washington, DC, USA}, author = {Winskel, Glynn}, booktitle = {LICS '05: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science}, citeulike-article-id = {3564528}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1079730}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/LICS.2005.45}, citeulike-linkout-2 = {http://www.cl.cam.ac.uk/~gw104/}, doi = {10.1109/LICS.2005.45}, isbn = {0-7695-2266-1}, keywords = {causality, concurrency, eventstructure}, pages = {2--11}, posted-at = {2008-11-18 10:10:09}, priority = {1}, publisher = {IEEE Computer Society}, title = {Relations in Concurrency}, url = {http://dx.doi.org/10.1109/LICS.2005.45}, year = {2005} }

TY - CONF ID - citeulike:3564528 L3 - citeulike-article-id:3564528 N2 - The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated via spans of event structures, and the semantics of nondeterministic dataflow. Profunctors are shown to play a key role in relating models for concurrency and to support an interpretation as higher-order processes (where input and output may be processes). Two recent directions of research are described. One is concerned with a language and computational interpretation for profunctors. This addresses the duality between input and output in profunctors. The other is to investigate general spans of event structures(the spans can be viewed as special profunctors) to give causalsemantics to higher-order processes. For this it is useful to generalise event structures to allow events which "persist." SN - 0-7695-2266-1 AD - Washington, DC, USA EP - 11 TI - Relations in Concurrency PB - IEEE Computer Society T2 - LICS '05: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science SP - 2 KW - causality KW - concurrency KW - eventstructure AU - Winskel, Glynn PY - 2005/// UR - http://dx.doi.org/10.1109/LICS.2005.45 ER -