How to relieve a programmer from synchronization details

Authors:
Ryszard Janicki
Affiliations:
Department of Computer Science and Systems, McMaster University, 1280 Main Street West Hamilton, Ontario, Canada L8S 4K1
Venue:
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Year:
1988

Citing 8
Cited 2

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
An introduction to the Maco COSY notation

Concurrency and nets: advances in Petri nets
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
A Construction of Concurrent Systems by Means of Sequential Solutions and Concurrency Relations

Proceedings of the International Colloquium on Formalization of Programming Concepts
Adequate Path Expressions

Proceedings of the International Sympoisum on Semantics of Concurrent Computation
A Method for Developing Concurrent Systems

Proceedings of the 6th Colloquium on International Symposium on Programming
COSY: Its Relation to Nets and CSP

Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II

Complete sequential specification allows for concurrent execution

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
A simple realization of a parallel device recognizing regular trace languages

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An alternative method of specifying concurrent systems is presented. The method consists in starting with a sequential program and next determining an independency relation that allows relaxation of the sequential structure of the program. A programming language and a theoretical background for the method are discussed.