an:06213301
Zbl 1272.68322
Thati, Prasanna; Sen, Koushik; Mart??-Oliet, Narciso
An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
EN
Gadducci, Fabio (ed.) et al., WRLA 2002. Proceedings of the 4th international workshop on rewriting logic and its applications, Pisa, Italy, September 19--21, 2002. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 71, 261-281 (2004).
2004
a
68Q85 68Q55 68Q60
Summary: We describe an executable specification of the operational semantics of an asynchronous version of the \(\pi\)-calculus in Maude by means of conditional rewrite rules with rewrites in the conditions. We also present an executable specification of the may testing equivalence on non-recursive asynchronous \(\pi\)-calculus processes, using the Maude metalevel. Specifically, we describe our use of the \texttt{metaSearch} operation to both calculate the set of all finite traces of a non-recursive process, and to compare the trace sets of two processes according to a preorder relation that characterizes may testing in asynchronous \(\pi\)-calculus. Thus, in both the specification of the operational semantics and the may testing, we make heavy use of new features introduced in version 2.0 of the Maude language and system.
For the entire collection see [Zbl 1271.68038].