Sciweavers

329 search results - page 40 / 66
» Asynchronous Communication in Process Algebra
Sort
View
SIROCCO
2010
13 years 9 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...
SP
1996
IEEE
106views Security Privacy» more  SP 1996»
13 years 12 months ago
Security Properties and CSP
Security properties such as con dentiality and authenticity may be considered in terms of the ow of messages within a network. To the extent that this characterisation is justi ed...
Steve Schneider
IFIP
2004
Springer
14 years 1 months ago
New-HOPLA: A Higher-order Process Language with Name Generation
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Glynn Winskel, Francesco Zappa Nardelli
PE
2011
Springer
167views Optimization» more  PE 2011»
13 years 2 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
SECON
2007
IEEE
14 years 1 months ago
INPoD: In-Network Processing over Sensor Networks based on Code Design
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
Kiran Misra, Shirish S. Karande, Hayder Radha