Abstract
In [15], processes represent incomplete specifications that guarantee proper behavior only under assumed constraints. Behaviors are represented as abstract executions. Here we define a corresponding notion of morphism, called process abstractions, as maps that preserve a composition operator on processes. We show that all process abstractions can be obtained from binary relations on execution sets, and we point out a ternary symmetry for process abstractions and the main composition operators. We rework and generalize correctness-preserving properties of commonly used process maps and we study new properties and maps of interest for verification.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call