83
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
93
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
CORR
2009
Springer
14 years 10 months ago
2009
Springer
143
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
64
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
60
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
CORR
2009
Springer
14 years 10 months ago
2009
Springer
69
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
115
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
We equip choreography-level session descriptions with a simple abstraction of a security infrastructure. Message components may be enclosed within (possibly nested) "boxes&quo...
60
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
claim that types are the right abstraction in order to represent the interaction between elements without specifying exactly the element positions. Our claim is supported through a...