Executing and verifying CCS in Maude


Downloads per month over past year




Downloads per month over past year

Verdejo López, José Alberto and Martí Oliet, Narciso (2000) Executing and verifying CCS in Maude. Technical report, 99-00 . pp. 1-47.

[thumbnail of 03-TR-99-00-ccs.pdf]


We explore the features of rewriting logic and its language Maude as a logical and semantic framework for representing both the semantics of CCS, and a modal logic for describing local capabilities of CCS processes. Although a rewriting logic representation of the CCS semantics was given in [MOM93], it cannot be directly executed in the current default interpreter of Maude. Moreover, it cannot be used to answer questions such as which are the successors of a process after performing an action, which is used to define the semantics of Hennessy-Milner modal logic. Basically, the problems are the existence of new variables in the righthand side of the rewrite rules and the nondeterministic application of the semantic rules, inherent to CCS. We show how these problems can be solved by exploiting the reflective properties of rewriting logic, which allow controlling the rewriting process. We also show how the semantics can be extended to traces of actions and to the CCS weak transition relation. This executable specification plus the reflective control of the rewriting process can be used to analyze CCS processes.

Item Type:Article
Uncontrolled Keywords:Operational semantics, rewriting logic, Maude, CCS, Hennessy-Milner modal logic
Subjects:Humanities > Philosophy > Logic
Sciences > Computer science > Programming languages (Electronic computers)
ID Code:1661
Deposited On:17 May 2005
Last Modified:06 Feb 2014 07:31

Origin of downloads

Repository Staff Only: item control page