Abstract
AbstractsWe consider (a slight variant of) the ccs calculus, and we analyze two operational semantics defined in the literature: the first exploits Proved Transition Systems (PTS) and the second Rewriting Logic (RL). We show that the interleaving interpretation of both semantics agree, in that they define the same transitions and exhibit the same nondeterministic structure. In addition, we study causality in ccs computations. We recall the treatment viaPTS, that exhibits the notion of causality presented in the literature, and we show how to recast it in the RL semantics via suitable axioms.
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.
