Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Delahaye, Benoit"'
Autor:
Ardourel, Gilles, Cantin, Guillaume, Delahaye, Benoît, Derroire, Géraldine, Funatsu, Beatriz M., Julien, David
Publikováno v:
In Ecological Modelling September 2024 495
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
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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
Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the transition probability values: transitions in pIMCs are labeled with p
Externí odkaz:
http://arxiv.org/abs/1706.00270
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
EPTCS 220, 2016
This volume contains the joint proceedings of the Workshop on Games for the Synthesis of Complex Systems (CASSTING'16) and of the 3rd International Workshop on Synthesis of Complex Parameters (SynCoP'16). The workshops were held in Eindhoven, The Net
Externí odkaz:
http://arxiv.org/abs/1608.00177
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming January 2020 110
There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal or modal logics and relies on efficient model checking algorithms; the
Externí odkaz:
http://arxiv.org/abs/1306.0741
Publikováno v:
Logical Methods in Computer Science, Volume 10, Issue 3 (August 26, 2014) lmcs:942
This paper studies a difference operator for stochastic systems whose specifications are represented by Abstract Probabilistic Automata (APAs). In the case refinement fails between two specifications, the target of this operator is to produce a speci
Externí odkaz:
http://arxiv.org/abs/1212.4288