PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Latella D., Loreti M., Massink M. Notes on Markovian Extension of a Dialect of Value Passing CCS. Technical report, 2008.
 
 
Abstract
(English)
Many calculi for Service Oriented Computing (SOC) are based on a two-party, CCS-like, communication paradigm. In the context of SOC architectures, code mobility and dynamic process creation will play a major role, especially in distributed environments. In this framework, properties like commutativity and associativity of parallel composition operators is highly desirable. In this note we show how a relevant subset of CCS with value passing can be extended with stochastic information in such a way that associativity and commutativity of process parallel compositions is preserved, in the sense that P|(Q|R) is strong Markovian bisimilar to (P|Q)|R.
Subject Stochastic Process Algebra
Value Passing CCS
H.1 Models and Principles
F.4 Mathematical Logic and Formal Languages
68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional