16790 search results - page 3108 / 3358 » A Future for Software Engineering |
142
click to vote
FOSSACS
2007
Springer
16 years 7 days ago
2007
Springer
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
181
click to vote
FOSSACS
2007
Springer
16 years 7 days ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
152
click to vote
FSEN
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
166
click to vote
FSEN
2007
Springer
16 years 7 days ago
2007
Springer
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...
169
click to vote
FSTTCS
2007
Springer
16 years 7 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...