We present a framework to formally describe system behavior and symbolically reason about possible failures. We regard systems which are composed of different units: sensors, computational parts and actuators. Considering worst-case failure behavior of system components, our framework is used to derive reliability guarantees for composed systems. The behavior of system components is modeled using monad like constructs that serve as an abstract representation for system behavior. We introduce rules to reason about these representations and derive results like, e.g., guaranteed upper bounds for system failure. Our approach is characterized by the fact that we do not just map a certain component to a failure probability, but regard distributio...
Abstract. We present a compositional verification technique for sys-tems that exhibit both probabili...
Dans les études de sûreté de fonctionnement des systèmes dynamiques et en particulier des systèmes d...
International audienceA contract allows to distinguish hypotheses made on a system (the guarantees) ...
Abstract. We present a framework to formally describe probabilistic system be-havior and symbolicall...
We present a compositional network proof theory to specify and verify safety properties of fault tol...
A compositional network proof theory for specifying and verifying fault tolerant real-time distribut...
In fault-tolerant computing, dependability of systems is usually demonstrated by abstracting from fa...
In this paper, we focus on Assume/Guarantee contracts consisting in (i) a non deterministic model of...
© 2015 IEEE.In this paper we propose a modelling formalism, Probabilistic Component Automata (PCA), ...
Abstract. Formal proofs of functional correctness and rigorous analyses of fault tolerance have, tra...
Formal proofs of functional correctness and rigorous analyses of fault tolerance have, traditionally...
This paper presents a calculus that enables a designer of an embedded, real-time system to reason ab...
Bounds are established for the probability of failure of fault-tolerant systems. The underlying fail...
Compositionality is a key property in the development and analy- sis of component-based systems. In ...
Abstract. We present a compositional verification technique for sys-tems that exhibit both probabili...
Dans les études de sûreté de fonctionnement des systèmes dynamiques et en particulier des systèmes d...
International audienceA contract allows to distinguish hypotheses made on a system (the guarantees) ...
Abstract. We present a framework to formally describe probabilistic system be-havior and symbolicall...
We present a compositional network proof theory to specify and verify safety properties of fault tol...
A compositional network proof theory for specifying and verifying fault tolerant real-time distribut...
In fault-tolerant computing, dependability of systems is usually demonstrated by abstracting from fa...
In this paper, we focus on Assume/Guarantee contracts consisting in (i) a non deterministic model of...
© 2015 IEEE.In this paper we propose a modelling formalism, Probabilistic Component Automata (PCA), ...
Abstract. Formal proofs of functional correctness and rigorous analyses of fault tolerance have, tra...
Formal proofs of functional correctness and rigorous analyses of fault tolerance have, traditionally...
This paper presents a calculus that enables a designer of an embedded, real-time system to reason ab...
Bounds are established for the probability of failure of fault-tolerant systems. The underlying fail...
Compositionality is a key property in the development and analy- sis of component-based systems. In ...
Abstract. We present a compositional verification technique for sys-tems that exhibit both probabili...
Dans les études de sûreté de fonctionnement des systèmes dynamiques et en particulier des systèmes d...
International audienceA contract allows to distinguish hypotheses made on a system (the guarantees) ...