Parallel Program Schemata and Maximal Parallelism I. Fundamental Results

DOI10.1145/321765.321782zbMath0273.68011MaRDI QIDQ5180826

Robert M. Keller

Publication date: 1973

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321765.321782

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68N01: General topics in the theory of software

Related Items

Livelocks in parallel programs, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, Polynomials, fragments of temporal logic and the variety DA over traces, Maximal serializability of iterated transactions, Serialization of concurrent programs, Methods and means of parallel processing of information, Functional behavior in data spaces, Local temporal logic is expressively complete for cograph dependence alphabets, Solving word equations modulo partial commutations, From local to global temporal logics over Mazurkiewicz traces., Efficient solution of some problems in free partially commutative monoids, SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE, Une approche quantitative de l'exclusion mutuelle, Unnamed Item, Encoding of parallel program schemata by vector addition systems, Functional systems: Theoretical and practical aspects