Document Open Access Logo

Strategies with Parallel Causes

Authors Marc de Visme, Glynn Winskel



PDF
Thumbnail PDF

File

LIPIcs.CSL.2017.41.pdf
  • Filesize: 0.55 MB
  • 21 pages

Document Identifiers

Author Details

Marc de Visme
Glynn Winskel

Cite AsGet BibTex

Marc de Visme and Glynn Winskel. Strategies with Parallel Causes. In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 82, pp. 41:1-41:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.CSL.2017.41

Abstract

We imagine a team Player engaging a team Opponent in a distributed game. Such games and their strategies have been formalised within event structures. However there are limitations in founding strategies on traditional event structures. Sometimes a probabilistic distributed strategy relies on benign races where, intuitively, several members of team Player may race each other to make a common move. Although there exist event structures which support such parallel causes, in which an event is enabled in several compatible ways, they do not support an operation of hiding central to the composition of strategies; nor do they support probability adequately. An extension of traditional event structures is devised which supports parallel causes and hiding, as well as the mix of probability and nondeterminism needed to account for probabilistic distributed strategies. The extension is located within existing models for concurrency and tested in the construction of a bicategory of probabilistic distributed strategies with parallel causes.
Keywords
  • Games
  • Strategies
  • Event Structures
  • Parallel Causes
  • Probability

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Ioana Cristescu. Operational and denotational semantics for the reversible pi-calculus. PhD thesis, PPS, Université Paris Diderot, 2015. Google Scholar
  2. G. M. Kelly. Basic concepts of enriched category theory. LNM 64. CUP, 1982. Google Scholar
  3. Y. Kinoshita and J. Power. Category theoretic structure of setoids. Theor. Comput. Sci., 546, 2014. Google Scholar
  4. John McCarthy. A basis for a mathematical theory of computation. In P. Brafford and D. Hirschberg, editors, Computer Programming and Formal Systems. North-Holland, 1963. Google Scholar
  5. Mogens Nielsen, Gordon Plotkin, and Glynn Winskel. Petri nets, event structures and domains. TCS, 13:85-108, 1981. Google Scholar
  6. Judea Pearl. Causality. CUP, 2013. Google Scholar
  7. John Power. 2-categories. BRICS Notes Series NS-98-7, 1998. Google Scholar
  8. Silvain Rideau and Glynn Winskel. Concurrent strategies. In LICS, 2011. Google Scholar
  9. Glynn Winskel. Events in computation. PhD thesis, University of Edinburgh, 1980. Google Scholar
  10. Glynn Winskel. Event structures. In Advances in Petri Nets, LNCS 255, 1986. Google Scholar
  11. Glynn Winskel. Distributed probabilistic and quantum strategies. ENTCS 298, 2013. Google Scholar
  12. Glynn Winskel. Event structures, stable families and concurrent games, 2016. URL: https://www.cl.cam.ac.uk/~gw104/ecsym-notes.pdf.
  13. Glynn Winskel and Mogens Nielsen. Handbook of Logic in Computer Science 4, chapter Models for Concurrency, pages 1-148. OUP, 1995. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail