Abstract
Process algebras are suitable for describing networks of communicating processes. In most process algebras, the description of such networks is achieved using parallel composition operators. Noticing that the parallel composition operators commonly found in process algebras are often limited in expressiveness and/or difficult for novice users, we propose a new parallel operator that allows networks of communicating processes to be described easily, in a simple and well-structured manner. We illustrate on various examples (token-ring network and client-server protocol) the theoretical and practical merits of this operator.
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.
