Complete sequential specification allows for concurrent execution

Authors:
R. Janicki;T. Muldner
Affiliations:
Department of Computer Science and Systems, McMaster University, 1280 Main Street West, Hamilton, Ont., Canada L8S 4K1;Department of Computer Science, The University of Western Ontario, Middlesex College, London, Ont., Canada N6A 5B7
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 7
Cited 1

Communicating sequential processes

Communicating sequential processes
An introduction to the Maco COSY notation

Concurrency and nets: advances in Petri nets
How to relieve a programmer from synchronization details

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Semigroups and Combinatorial Applications

Semigroups and Combinatorial Applications
Operating system principles

Operating system principles
Specification and Analysis of Concurrent Systems: The COSY Approach

Specification and Analysis of Concurrent Systems: The COSY Approach
Data Structures and Algorithms

Data Structures and Algorithms

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

In this paper we describe complete sequential specifications, that is sequential specifications extended with a declaration of the actions that are independent and have a potential for a concurrent execution. Next, we briefly describe the Banach programming language which supports the above form of specification. We show a translation of a particular form of the complete sequential specifications, namely Banach programs into a concurrent specification, in the form of synchronized, potentially concurrent regular expressions. The latter specification can be translated into an equivalent concurrent specification, and finally into a concurrent programming language, such as occam. Several examples explain our approach.