Results 1 
4 of
4
An Executable Specification of Asynchronous PiCalculus Semantics and May Testing in Maude 2.0
 in Maude 2.0. Proc. WRLA’02, ENTCS 71
, 2003
"... We describe an executable specification of the operational semantics of an asynchronous version of the #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 nonrecursive asynchronous # ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
We describe an executable specification of the operational semantics of an asynchronous version of the #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 nonrecursive asynchronous #calculus processes, using the Maude metalevel. Specifically, we describe our use of the metaSearch operation to both calculate the set of all finite traces of a nonrecursive process, and to compare the trace sets of two processes according to a preorder relation that characterizes may testing in asynchronous #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.
Basic Observables for a Calculus for Global Computing
, 2004
"... We discuss a basic process calculus useful for modelling applications over global computing systems and present the associated semantic theories as determined by some basic notions of observation. The main features of the calculus are explicit distribution, remote operations, process mobility and ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
We discuss a basic process calculus useful for modelling applications over global computing systems and present the associated semantic theories as determined by some basic notions of observation. The main features of the calculus are explicit distribution, remote operations, process mobility and asynchronous communication through distributed data spaces. We introduce some natural notions of extensional observations and study their closure under operational reductions and/or language contexts to obtain barbed congruence and may testing. For these equivalences, we provide alternative tractable characterizations as labelled bisimulation and trace equivalence. We discuss some of the induced equational laws and relate them to design choices of the calculus. In particular, we show that some of these laws do not hold any longer if the language is rendered less abstract by introducing (asynchronous and undetectable) failures or by implementing remote communications via process migrations and local exchanges. In both
An Algebraic Theory of Actors and its Application to a Simple ObjectBased Language
 In OleJohan Dahl’s Festschrift, volume 2635 of LNCS
, 2004
"... ..."
Techniques for Executing and Reasoning about Specification Diagrams
, 2004
"... Specification Diagrams (SD) [19] are a graphical notation for specifying the message passing behavior of open distributed object systems. SDs facilitate ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Specification Diagrams (SD) [19] are a graphical notation for specifying the message passing behavior of open distributed object systems. SDs facilitate