Sciweavers

1724 search results - page 223 / 345
» Models for Concurrency
Sort
View
SOFSEM
2009
Springer
15 years 6 months ago
Time and Fairness in a Process Algebra with Non-blocking Reading
We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairnes...
Flavio Corradini, Maria Rita Di Berardini, Walter ...
CONCUR
2001
Springer
15 years 2 months ago
Probabilistic Information Flow in a Process Algebra
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
Alessandro Aldini
ECEASST
2008
106views more  ECEASST 2008»
14 years 10 months ago
Controlling resource access in Directed Bigraphs
: We study directed bigraph with negative ports, a bigraphical framework for representing models for distributed, concurrent and ubiquitous computing. With respect to previous vers...
Davide Grohmann, Marino Miculan
ENTCS
2006
112views more  ENTCS 2006»
14 years 10 months ago
Interface Automata with Complex Actions
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
Shahram Esmaeilsabzali, Farhad Mavaddat, Nancy A. ...
CLUSTER
2009
IEEE
15 years 4 months ago
Utility analysis for Internet-oriented server consolidation in VM-based data centers
—Server consolidation based on virtualization technology will simplify system administration, reduce the cost of power and physical infrastructure, and improve utilization in tod...
Ying Song, Yanwei Zhang, Yuzhong Sun, Weisong Shi