A true concurrency semantics for parallel programs

Abstract The paper shows, how the true concurrency model for concurrent systems, so-called directed, acyclic, arc-labelled graphs, and propositional Concurrent Temporal Logic, that have been developed for the specification and verification of elementary net systems, can be adapted to give a true concurrency semantics to shared variables programs, and to write first-order specifications of the programs, so that also concurrency can be specified.