A truly concurrent semantics for a simple parallel programming language

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1683, Issue , 1999, Pages 515-529

  Gastin, Paul ^a   Mislove, Michael ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; PARALLEL PROGRAMMING; SEMANTICS;

CONCURRENT LANGUAGES; CONCURRENT SEMANTICS; DENOTATIONAL MODELS; DENOTATIONAL SEMANTICS; DETERMINISTIC SEMANTICS; RESTRICTION OPERATORS; SEQUENTIAL COMPOSITIONS; SYNCHRONOUS PARALLEL COMPOSITIONS;

COMPUTER CIRCUITS;

EID: 0009751824     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_36     Document Type: Conference Paper

References (9)

1. Abramsky, S and A. Jung, Domain Theory, in: "Handbook of Computer Science and Logic," Volume 3, Clarendon Press, 1995.
2. Diekert, V. and P. Gastin, Approximating traces, Acta Informatica 35 (1998), pp. 567-593.
3. Diekert, V. and G. Rozenberg, editors, "The Book of Traces," World Scientific, Singapore (1995).
4. Gastin, P. and D. Teodesiu, Resource traces: a domain for process sharing exclusive resources, Theoretical Computer Science, to appear.
5. Hennessy, M. and G. D. Plotkin, Full abstraction for a simple parallel programming language, Lecture Notes in Computer Science 74 (1979), Springer-Verlag
6. Mazurkiewicz, A., Trace theory, Lecture Notes in Computer Science 255 (1987), pp. 279-324.
7. Pratt, V., On the composition of processes, Proceedings of the Ninth POPL (1982).
8. Reisig, W., "Petri Nets," EATCS Monographs in Theoretical Computer Science 4 (1985), Springer-Verlag.
9. Winskel, G., "Events in Computation," Ph.D. Thesis, University of Cambridge, 1980.