Parallel Program Schemata and Maximal Parallelism I. Fundamental Results

DOI10.1145/321765.321782MaRDI QIDQ5180826zbMATH OpenOpenAlexFDO

Authors 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

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(19)

• 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
• Encoding of parallel program schemata by vector addition systems
• scientific article; zbMATH DE number 3657112 (Why is no real title available?)
• Functional systems: Theoretical and practical aspects
• Livelocks in parallel programs
• Logspace computations in graph products
• Quadratic equations in graph products of groups and the exponent of periodicity
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces
• Polynomials, fragments of temporal logic and the variety DA over traces
• Controlling loosely cooperating processes

This page was built for publication: Parallel Program Schemata and Maximal Parallelism I. Fundamental Results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5180826)