272 search results - page 43 / 55 » On Efficient Models for Model Checking Message-Passing Distr... |
114
click to vote
HIPC
2007
Springer
15 years 3 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
FOSSACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...
113
click to vote
FORMATS
2003
Springer
15 years 4 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
ICNP
2009
IEEE
15 years 6 months ago
2009
IEEE
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
137
click to vote
WOA
2010
14 years 9 months ago
2010
This paper deals with the definition of a strong authentication model, coupling usual password/PIN based methods with a biometric matching, over a Multi Agent distributed infrastru...