Abstract

Two techniques are introduced for achieving semantics preserving transformations of process interconnection patterns described by algebraic parallel behaviour expressions. The semantic relation to be preserved is strong bisimulation equivalence. Convenient process network representations are identified as unique representatives of equivalence classes of parallel expressions. The first transformation technique is very simple, but can only be applied to a restricted class of expressions. The second technique is general, and achieves the desired process regrouping, whenever it exists, by inscribing the multi-arcs of the underlying process network into the binary syntax tree of a target expression pattern. The described transformation techniques have been implemented in the LOTOS Integrated Tool Environment (LITE) of ESPRIT Project LotoSphere.

Full Text
Paper version not known

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

Disclaimer: 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.