Abstract. We present a framework to formally describe probabilistic system be-havior and symbolically reason about it. In particular we aim at reasoning about possible failures and fault tolerance. 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 most suited to derive reliability guarantees for composed systems. The behavior of system com-ponents is modeled using monad like constructs that serve as an abstract repre-sentation for system behavior. We introduce rules to reason about these represen-tations and derive results like guaranteed upper bounds for system failure. Our approach is characterized by the fact ...
International audienceA contract allows to distinguish hypotheses made on a system (the guarantees) ...
A compositional network proof theory for specifying and verifying fault tolerant real-time distribut...
Compositionality is a key property in the development and analy- sis of component-based systems. In ...
We present a framework to formally describe system behavior and symbolically reason about possible f...
In fault-tolerant computing, dependability of systems is usually demonstrated by abstracting from fa...
This paper presents a calculus that enables a designer of an embedded, real-time system to reason ab...
In this paper, we focus on Assume/Guarantee contracts consisting in (i) a non deterministic model of...
Formal proofs of functional correctness and rigorous analyses of fault tolerance have, traditionally...
© 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...
Dans les études de sûreté de fonctionnement des systèmes dynamiques et en particulier des systèmes d...
We present a compositional network proof theory to specify and verify safety properties of fault tol...
. Action systems were originally proposed for the design of parallel and distributed systems in a st...
We present a compositional verification technique for systems that exhibit both probabilistic and no...
Probabilistic model checking is a powerful formal verification method that can ensure the correctnes...
International audienceA contract allows to distinguish hypotheses made on a system (the guarantees) ...
A compositional network proof theory for specifying and verifying fault tolerant real-time distribut...
Compositionality is a key property in the development and analy- sis of component-based systems. In ...
We present a framework to formally describe system behavior and symbolically reason about possible f...
In fault-tolerant computing, dependability of systems is usually demonstrated by abstracting from fa...
This paper presents a calculus that enables a designer of an embedded, real-time system to reason ab...
In this paper, we focus on Assume/Guarantee contracts consisting in (i) a non deterministic model of...
Formal proofs of functional correctness and rigorous analyses of fault tolerance have, traditionally...
© 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...
Dans les études de sûreté de fonctionnement des systèmes dynamiques et en particulier des systèmes d...
We present a compositional network proof theory to specify and verify safety properties of fault tol...
. Action systems were originally proposed for the design of parallel and distributed systems in a st...
We present a compositional verification technique for systems that exhibit both probabilistic and no...
Probabilistic model checking is a powerful formal verification method that can ensure the correctnes...
International audienceA contract allows to distinguish hypotheses made on a system (the guarantees) ...
A compositional network proof theory for specifying and verifying fault tolerant real-time distribut...
Compositionality is a key property in the development and analy- sis of component-based systems. In ...