488 search results - page 7 / 98 » Compositional Verification of Probabilistic Systems Using Le... |
141
click to vote
SIGSOFT
2003
ACM
16 years 7 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
188
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, biological (human) music composition systems based on Time Delay Neural Networks and Ward Nets and on a probabilistic Finite-State Machine will be presented. The sys...
194
click to vote
ISSRE
2010
IEEE
15 years 4 months ago
2010
IEEE
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
181
click to vote
CONCUR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
154
click to vote
FASE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a novel algorithm for interface generation of software components. Given a component, our algorithm uses learning techniques to compute a permissive interface ...