Skip to main content
Journal ArticleOPEN ACCESS

Angelic semantics of fine-grained concurrency

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2987 211-225
DOI: 10.1007/978-3-540-24727-2_16
30Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce a game model for a procedural programming language extended with primitives for parallel composition and synchronization on binary semaphores. The model uses an interleaved version of Hyland-Ong-style games, where most of the original combinatorial constraints on positions are replaced with a simple principle naturally related to static process creation. The model is fully abstract for mayequivalence. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Ghica, D. R., & Murawski, A. S. (2004). Angelic semantics of fine-grained concurrency. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2987, 211–225. https://doi.org/10.1007/978-3-540-24727-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free