Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
From MaRDI portal
Publication:5180826
DOI10.1145/321765.321782zbMath0273.68011OpenAlexW1990300406MaRDI QIDQ5180826
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
Related Items
Efficient solution of some problems in free partially commutative monoids, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, Une approche quantitative de l'exclusion mutuelle, Unnamed Item, Serialization of concurrent programs, Polynomials, fragments of temporal logic and the variety DA over traces, Controlling loosely cooperating processes, Methods and means of parallel processing of information, Solving word equations modulo partial commutations, Local temporal logic is expressively complete for cograph dependence alphabets, From local to global temporal logics over Mazurkiewicz traces., Encoding of parallel program schemata by vector addition systems, Functional behavior in data spaces, Functional systems: Theoretical and practical aspects, Logspace computations in graph products, Livelocks in parallel programs, SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE, Maximal serializability of iterated transactions
