Abstract
We introduce a new way of describing a subclass of CSP processes in the failures-divergence model. These processes will be called rational, by analogy with rational languages in formal language theory. Usually, rational languages are characterized as a solution of a linear system of equations. In this work we use a restricted set of CSP operators and recursion to define CSP-linear systems. We show that these systems are in many respects similar to linear systems in formal language theory. Our main result states that for linear systems the least fix point solution in a CPO can be obtained using Arden's lemma. Furthermore we give an alternative definition of the class of rational processes in terms of automata. Finally we analyze how the previous result can be extended to other semantic models.
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.
