Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Cyrille Jegourel"'
Autor:
Yee Wang Sui, Koh Xian Ming, Malika Meghjani, Nagarajan Raghavan, Cyrille Jegourel, Keegan Kang
Publikováno v:
OCEANS 2022, Hampton Roads.
Publikováno v:
ACM Transactions on Modeling and Computer Simulation. 29:1-22
Statistical Model Checking (SMC) is an approximate verification method that overcomes the state space explosion problem for probabilistic systems by Monte Carlo simulations. Simulations might, however, be costly if many samples are required. It is th
Publikováno v:
Computer Aided Verification ISBN: 9783030532901
CAV (2)
Computer Aided Verification
CAV 2020-32nd International Conference on Computer-Aided Verification
CAV 2020-32nd International Conference on Computer-Aided Verification, Jul 2020, Los Angeles, United States. pp.304-326
CAV (2)
Computer Aided Verification
CAV 2020-32nd International Conference on Computer-Aided Verification
CAV 2020-32nd International Conference on Computer-Aided Verification, Jul 2020, Los Angeles, United States. pp.304-326
International audience; Learning models from observations of a system is a powerful tool with many applications. In this paper, we consider learning Discrete Time Markov Chains (DTMC), with different methods such as frequency estimation or Laplace sm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09d8a62e8c0737b174dc1186e0a68797
https://doi.org/10.1007/978-3-030-53291-8_17
https://doi.org/10.1007/978-3-030-53291-8_17
Publikováno v:
DSN
In real-world systems, rare events often characterize critical situations like the probability that a system fails within some time bound and they are used to model some potentially harmful scenarios in dependability of safety-critical systems. Proba
Publikováno v:
Leveraging Applications of Formal Methods, Verification and Validation. Verification ISBN: 9783030034207
ISoLA (2)
ISoLA (2)
Several schemes have been provided in Statistical Model Checking (SMC) for the estimation of property occurrence based on predefined confidence and absolute or relative error. Simulations might be however costly if many samples are required and the u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78a2cc247305c81d02dfbf270605c322
https://doi.org/10.1007/978-3-030-03421-4_19
https://doi.org/10.1007/978-3-030-03421-4_19
Publikováno v:
Formal Methods and Software Engineering ISBN: 9783030024499
ICFEM
ICFEM
Verifying whether rational participants in a BAR system (a distributed system including Byzantine, Altruistic and Rational participants) would deviate from the specified behaviour is important but challenging. Existing works consider this as Nash-equ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4a79325da1108c72ed117c03bf63888
https://doi.org/10.1007/978-3-030-02450-5_7
https://doi.org/10.1007/978-3-030-02450-5_7
Publikováno v:
Quantitative Evaluation of Systems ISBN: 9783319663340
QEST
QEST
Statistical Model Checking (SMC) is an approximate verification method that overcomes the state space explosion problem for probabilistic systems by Monte Carlo simulations. Simulations might be however costly if many samples are required. It is thus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b9cbf8b2d62041aad0736f52bf97b06
https://doi.org/10.1007/978-3-319-66335-7_23
https://doi.org/10.1007/978-3-319-66335-7_23
Publikováno v:
ICECCS
A BAR system specifies a cooperation between agents who can be altruistic when they follow the specified behaviours, Byzantine when they randomly deviate from specifications and rational when they deviate to increase their own benefits. We consider w
Automatically 'Verifying' Discrete-Time Complex Systems through Learning, Abstraction and Refinement
Precisely modeling complex systems like cyber-physical systems is challenging, which often render model-based system verification techniques like model checking infeasible. To overcome this challenge, we propose a method called LAR to automatically `
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2727fd72932758fd7680b1dcfc73fb11
http://arxiv.org/abs/1610.06371
http://arxiv.org/abs/1610.06371
Autor:
Marius Mikučionis, Axel Legay, Cyrille Jegourel, Danny Bøgsted Poulsen, Kim Guldstrand Larsen, Sean Sedwards
Publikováno v:
Lecture Notes in Computer Science
Dependable Software Engineering: Theories, Tools, and Applications ISBN: 9783319476766
SETTA
Dependable Software Engineering: Theories, Tools, and Applications
Dependable Software Engineering: Theories, Tools, and Applications, Nov 2016, Beijing, China
Jegourel, C, Larsen, K G, Legay, A, Mikučionis, M, Poulsen, D B & Sedwards, S 2016, Importance Sampling for Stochastic Timed Automata . in M Fränzle, D Kapur & N Zhan (eds), Dependable Software Engineering : Theories, Tools, and Applications . Springer, Lecture Notes in Computer Science, vol. 9984, pp. 163-178, Symposium on Dependable Software Engineering Theories, Tools and Applications, Beijing, China, 09/11/2016 . https://doi.org/10.1007/978-3-319-47677-3_11
Lecture Notes in Computer Science-Dependable Software Engineering: Theories, Tools, and Applications
Dependable Software Engineering: Theories, Tools, and Applications ISBN: 9783319476766
SETTA
Dependable Software Engineering: Theories, Tools, and Applications
Dependable Software Engineering: Theories, Tools, and Applications, Nov 2016, Beijing, China
Jegourel, C, Larsen, K G, Legay, A, Mikučionis, M, Poulsen, D B & Sedwards, S 2016, Importance Sampling for Stochastic Timed Automata . in M Fränzle, D Kapur & N Zhan (eds), Dependable Software Engineering : Theories, Tools, and Applications . Springer, Lecture Notes in Computer Science, vol. 9984, pp. 163-178, Symposium on Dependable Software Engineering Theories, Tools and Applications, Beijing, China, 09/11/2016 . https://doi.org/10.1007/978-3-319-47677-3_11
Lecture Notes in Computer Science-Dependable Software Engineering: Theories, Tools, and Applications
International audience; We present an importance sampling framework that combines symbolic analysis and simulation to estimate the probability of rare reachability properties in stochastic timed automata. By means of symbolic exploration, our framewo