Relating state transformation semantics and predicate transformer semantics for parallel programs

F. vanBreugel · 1993

A state transformation semantics and a predicate transformer semantics for programs built from atomic actions, sequential composition, nondeterministic choice, parallel composition, atomisation, and recursion are presented. Both semantic models are derived from some SOS-style labelled transition system. The state transformation semantics and the predicate transformer semantics are shown to be isomorphic extending results of Plotkin and Best. AMS Subject Classification (1991): 68Q55 CR Subject Classification (1991): D.3.1, F.3.2 Keywords & Phrases: state transformation, predicate transformer, isomorphism, labelled transition system, parallelism Note: This work was partially supported by the Netherlands Nationale Faciliteit Informatica programme, project Research and Education in Concurrent Systems (REX).

Read the paper · More papers on PaperTik