Complexity of expressions allowing concurrency

Authors:
W. F. Ogden;W. E. Riddle;W. C. Round
Affiliations:
Case Western Reserve University, Cleveland, Ohio;University of Colorado, Boulder, Colorado;University of Michigan, Ann Arbor, Michigan
Venue:
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1978

Citing 10
Cited 9

Mappings of languages by two-tape devices

Journal of the ACM (JACM)
Process Structuring

ACM Computing Surveys (CSUR)
Petri Nets

ACM Computing Surveys (CSUR)
Reduction: a method of proving properties of parallel programs

Communications of the ACM
A relational model of data for large shared data banks

Communications of the ACM
The specification of process synchronization by path expressions

Operating Systems, Proceedings of an International Symposium
A consistent and complete deductive system for the verification of parallel programs

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The modeling and analysis of supervisory systems

The modeling and analysis of supervisory systems
Data structures: specification and realization.

Data structures: specification and realization.
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Figures of merit

ACM SIGACT News
Advanced Thread Synchronization in Java Using Interaction Expressions

NODe '02 Revised Papers from the International Conference NetObjectDays on Objects, Components, Architectures, Services, and Applications for a Networked World
Anomaly detection in concurrent programs

ICSE '79 Proceedings of the 4th international conference on Software engineering
Infinite unfair shuffles and associativity

Theoretical Computer Science
A Theory for Protocol Validation

IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
The membership problem for regular expressions with unordered concatenation and numerical constraints

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
Unshuffling a square is NP-hard

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study some consequences of the formal language approach to modelling software system behavior for the case of asynchronous, concurrent subsystems. We use the formal language shuffle operation to give an "algebraic" definition of semantics for a simple (structured) concurrent programming language and prove that the use of this operation is necessary. Having established this necessity, we investigate other types of behavioral expressions which use the operation and show that the analysis problem for these expressions is either undecidable or intractable. The results provide some limitations, for example, on the path expression method of system behavior analysis. Our lower bound proofs involve the use of synchronization symbols, which seem to be a formal language analogue of semaphores.