Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Fournier, Paulin"'
Decisiveness has proven to be an elegant concept for denumerable Markov chains: it is general enough to encompass several natural classes of denumerable Markov chains, and is a sufficient condition for simple qualitative and approximate quantitative
Externí odkaz:
http://arxiv.org/abs/2008.10426
The CLEARSY Safety Platform (CSSP) was designed to ease the development of safety critical systems and to reduce the overall costs (development, deployment, and certification) under the pressure of the worldwide market. A smart combination of hardwar
Externí odkaz:
http://arxiv.org/abs/2005.10662
Autor:
Fournier, Paulin, Lhote, Nathan
We show that one can decide if a rational equivalence relation can be given as the equivalence kernel of a sequential letter-to-letter transduction. This problem comes from the setting of games with imperfect information. In [1, p. 6] the authors pro
Externí odkaz:
http://arxiv.org/abs/1910.06019
We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interval Markov Chains. In this context, we consider the consistency problem
Externí odkaz:
http://arxiv.org/abs/1906.04982
In this paper we consider state reachability in networks composed of many identical processes running a parametric timed broadcast protocol (PTBP). PTBP are a new model extending both broadcast protocols and parametric timed automata. This work is, u
Externí odkaz:
http://arxiv.org/abs/1811.12576
Autor:
Fournier, Paulin, Gimbert, Hugo
We introduce a new class of automata on infinite trees called \emph{alternating nonzero automata}, which extends the class of non-deterministic nonzero automata. We reduce the emptiness problem for alternating nonzero automata to the same problem for
Externí odkaz:
http://arxiv.org/abs/1802.04067
Autor:
Fournier, Paulin
Ce travail s'inscrit dans le cadre de la vérification formelle de programmes. La vérification de modèle permet de s'assurer qu'une propriété est vérifiée par le modèle du système. Cette thèse étudie la vérification paramétrée de réseau
Externí odkaz:
http://www.theses.fr/2015REN1S170/document
Deterministic two-way transducers define the robust class of regular functions which is, among other good properties, closed under composition. However, the best known algorithms for composing two-way transducers cause a double exponential blow-up in
Externí odkaz:
http://arxiv.org/abs/1702.07157
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming January 2020 110
We propose a simulation-based technique, in the spirit of Statistical Model Checking, for approximate verification of probabilis-tic models with parametric transitions, and we focus in particular on parametric Markov chains. Our technique is based on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2c4b8008a8a3f2f9305277677c8811f9
https://hal.archives-ouvertes.fr/hal-02021064/file/main.pdf
https://hal.archives-ouvertes.fr/hal-02021064/file/main.pdf