Sciweavers

7557 search results - page 548 / 1512
» Modeling Timed Concurrent Systems
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
QEST
2005
IEEE
16 years 17 days ago
Fluid Flow Approximation of PEPA models
In this paper we present a novel performance analysis technique for large-scale systems modelled in the stochastic process algebra PEPA. In contrast to the well-known approach of ...
Jane Hillston
WETICE
2007
IEEE
16 years 1 months ago
Coordinating Knowledge in Pervasive Environments
A new application of tuple-space-based coordination systems is in knowledge communication and representation. This knowledge is being published on the Web (the so-called “Semant...
Lyndon J. B. Nixon, Robert Tolksdorf, Alan Wood, R...
DANCE
2002
IEEE
15 years 12 months ago
Developing Dynamic Security Policies
In this paper we define and provide a general construction for a class of policies we call dynamic policies. In most existing systems, policies are implemented and enforced by ch...
Prasad Naldurg, Roy H. Campbell, M. Dennis Mickuna...
CDC
2009
IEEE
133views Control Systems» more  CDC 2009»
15 years 11 months ago
On the security of linear consensus networks
Abstract—This work considers the problem of reaching consensus in an unreliable linear consensus network. A solution to this problem is relevant for several tasks in multi-agent ...
Fabio Pasqualetti, Antonio Bicchi, Francesco Bullo