International audienceSeveral ways of assigning probabilities to runs of timed automata (TA) have been proposed recently. When only the TA is given, a relevant question is to design a probability distribution which represents in the best possible way the runs of the TA. This question does not seem to have been studied yet. We give an answer to it using a maximal entropy approach. We introduce our variant of stochastic model, the stochastic process over runs which permits to simulate random runs of any given length with a linear number of atomic operations. We adapt the notion of Shannon (continuous) entropy to such processes. Our main contribution is an explicit formula defining a process $Y^*$ which maximizes the entropy. This formula is a...
Since early 90s, timed automata and timed languages are extensively used for modelling and verificat...
Plenary LectureInternational audienceThe construction of probabilistic models in computational scien...
This paper presents the theoretical underpinning of a model for symbolically representing probabilis...
AbstractWe propose a model of probabilistic timed automaton which substitutes for the non-determinis...
Abstract. The channel capacity of a deterministic system with confidential data is an upper bound on...
International audienceThe channel capacity of a deterministic system with confidential data is an up...
A stochastic timed automaton is a purely stochastic process defined on atimed automaton, in which bo...
We discuss a new model for the analysis and simulation of stochastic systems which we call stochasti...
Loosely speaking, the Shannon entropy rate is used to gauge a stochastic process' intrinsic randomne...
We propose deterministic timed automata (DTA) as a model-independent language for specifying perform...
International audienceThe construction of probabilistic models in computational mechanics requires t...
Loosely speaking, the Shannon entropy rate is used to gauge a stochastic process’ intrinsic randomne...
Abstract. A stochastic timed automaton is a purely stochastic process defined on a timed automaton, ...
We give a characterization of Maximum Entropy/Minimum Relative Entropy inference by providing two ‘s...
The maximum entropy principle provides one of the bases for specification of complete models from pa...
Since early 90s, timed automata and timed languages are extensively used for modelling and verificat...
Plenary LectureInternational audienceThe construction of probabilistic models in computational scien...
This paper presents the theoretical underpinning of a model for symbolically representing probabilis...
AbstractWe propose a model of probabilistic timed automaton which substitutes for the non-determinis...
Abstract. The channel capacity of a deterministic system with confidential data is an upper bound on...
International audienceThe channel capacity of a deterministic system with confidential data is an up...
A stochastic timed automaton is a purely stochastic process defined on atimed automaton, in which bo...
We discuss a new model for the analysis and simulation of stochastic systems which we call stochasti...
Loosely speaking, the Shannon entropy rate is used to gauge a stochastic process' intrinsic randomne...
We propose deterministic timed automata (DTA) as a model-independent language for specifying perform...
International audienceThe construction of probabilistic models in computational mechanics requires t...
Loosely speaking, the Shannon entropy rate is used to gauge a stochastic process’ intrinsic randomne...
Abstract. A stochastic timed automaton is a purely stochastic process defined on a timed automaton, ...
We give a characterization of Maximum Entropy/Minimum Relative Entropy inference by providing two ‘s...
The maximum entropy principle provides one of the bases for specification of complete models from pa...
Since early 90s, timed automata and timed languages are extensively used for modelling and verificat...
Plenary LectureInternational audienceThe construction of probabilistic models in computational scien...
This paper presents the theoretical underpinning of a model for symbolically representing probabilis...