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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
