PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
De Nicola R., Latella D., Loreti M., Massink M. Rate-based transition systems for stochastic process calculi. In: ICALP 2009 - Automata, Languages and Programming. 36th Internatilonal Colloquium (Rhodes, Greece, 5-12 July 2009). Proceedings, vol. II pp. 435 - 446. (Lecture Notes in Computer Science, vol. 5556). Springer Verlag, 2009.
 
 
Abstract
(English)
A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition relation used in our variant associates to each process, for each action, the set of possible futures paired with a measure indicating their rates. We show how RTS can be used for providing the operational semantics of stochastic extensions of classical formalisms, namely CSP and CCS. We also show that our semantics for stochastic CCS guarantees associativity of parallel composition. Similarly, in contrast with the original definition by Priami, we argue that a semantics for stochastic pi-calculus can be provided that guarantees associativity of parallel composition.
URL: http://www.springerlink.com/content/jh9175220713/?sortorder=asc&p_o=30
DOI: 10.1007/978-3-642-02930-1_36
Subject Rate-Based Transition Systems
Structured Operational Semantics
D.2.4 Software/Program Verification (formal methods)
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