Sciweavers

443 search results - page 60 / 89
» Relations in Concurrency
Sort
View
CSE
2009
IEEE
14 years 3 months ago
A Framework for Enforcing Constrained RBAC Policies
—Constraints are an important part of role-based access control policies. The safety or security of a system is maintained by enforcing constraints that are specified in the pol...
Jason Crampton, Hemanth Khambhammettu
CONCUR
2008
Springer
13 years 10 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
INFOCOM
2006
IEEE
14 years 2 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
IMC
2007
ACM
13 years 10 months ago
An active measurement system for shared environments
Testbeds composed of end hosts deployed across the Internet enable researchers to simultaneously conduct a wide variety of experiments. Active measurement studies of Internet path...
Joel Sommers, Paul Barford
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon