| 1. |
- Atif, Muhammad, et al.
(författare)
-
Reconstruction and verification of group membership protocols
- 2010
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- In this paper, we present a process-algebraic specication of group membership protocols specified in [Y. Amir, D. Dolev, S. Kramer and D. Malki, Membership Algorithms for Multicast Communication Groups, Springer-Verlag, 1992]. In order to formalise the protocol and its properties we disambiguate the informal specification provided by the paper. This requires trying different possible interpretations in the formal model and checking the consistency of the assumption and formally verifying the correctness properties. We thus present a formal reconstruction of the membership algorithms and model-check our reconstruction.
|
|
| 2. |
- Cranen, Sjoerd, et al.
(författare)
-
A rule format for associativity
- 2008
-
Ingår i: CONCUR 2008 - Concurrency Theory. - Berlin : Springer Berlin/Heidelberg. - 9783540853602 - 9783540853619 - 354085360X ; , s. 447-461
-
Konferensbidrag (refereegranskat)abstract
- We propose a rule format that guarantees associativity of binary operators with respect to all notions of behavioral equivalence that are defined in terms of (im)possibility of transitions, e.g., the notions below strong bisimilarity in van Glabbeek's spectrum. The initial format is a subset of the De Simone format. We show that all trivial generalizations of our format are bound for failure. We further extend the format in a few directions and illustrate its application to several formalisms in the literature. A subset of the format is studied to obtain associativity with respect to graph isomorphism.
|
|
| 3. |
- Cranen, Sjoerd, et al.
(författare)
-
Global schedulability analysis of a synchronization protocol based on replenishment-bounded overrun for compositional real-time systems
- 2012
-
Ingår i: 7th IEEE International Symposium on Industrial Embedded Systems, SIES 2012 - Conference Proceedings. - 9781467326841 ; , s. 39-47
-
Konferensbidrag (refereegranskat)abstract
- Hierarchical scheduling frameworks (HSFs) provide means for composing complex real-time systems from well-defined independently developed and analyzed subsystems. To support shared logical resources requiring mutual exclusive access in two-level HSFs, overrun without payback has been proposed as a mechanism to prevent budget depletion during resource access arbitrated by the stack resource policy (SRP). The same mechanism can be applied to support scheduling techniques, such as fixed-priority scheduling with deferred preemption (FPDS), that aim at a reduction of the architecture-related preemption costs and may improve the feasibility of a system. Whereas the blocking times and overrun budgets for shared logical resources will typically be much smaller than the normal budget, these values may significantly increase for scheduling techniques such as FPDS. In this paper, we therefor consider replenishment-bounded overrun, i.e. the overrun ends upon a replenishment, because the normal budget becomes available again, which allows for larger overrun budgets. We show that the global schedulability analysis for this special kind of overrun has a number of anomalies: (i) the usual theorem for critical instant does not hold, (ii) maximal blocking does not necessarily lead to a maximal response time, and (iii) it is not sufficient to analyse a fixed amount of time (say, a number of hyperperiods). We present analysis for two subsystems.
|
|
