Zobrazeno 1 - 10 of 207 pro vyhledávání: '"Béatrice Bérard"'
1
Revisiting Reachability in Polynomial Interrupt Timed Automata
Autor: Serge Haddad, Béatrice Bérard
Publikováno v: Information Processing Letters
Information Processing Letters, Elsevier, 2022, 174, pp.106208. ⟨10.1016/j.ipl.2021.106208⟩
Information Processing Letters, 2022, 174, pp.106208. ⟨10.1016/j.ipl.2021.106208⟩
International audience; Polynomial Interrupt Timed Automata (PolITA) are finite automata with clocks organized along hierarchical levels. These clocks are equipped with an interruption mechanism, well suited to the modeling of real-time operating sys
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8a4cbda7876413b83679ac061811009b
https://hal.sorbonne-universite.fr/hal-03390569/document
Zobrazit plný text záznamu
2
Synthesis in presence of dynamic links
Autor: Patricia Bouyer, Benedikt Bollig, Nathalie Sznajder, Béatrice Bérard, Matthias Függer
Publikováno v: GandALF
Proceedings of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20)
GandALF'20-11th International Symposium on Games, Automata, Logics, and Formal Verification
GandALF'20-11th International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2020, Brussels (online), Belgium
Information and Computation
Information and Computation, Elsevier, 2021, pp.104856. ⟨10.1016/j.ic.2021.104856⟩
Information and Computation, 2021, pp.104856. ⟨10.1016/j.ic.2021.104856⟩
The problem of distributed synthesis is to automatically generate a distributed algorithm, given a target communication network and a specification of the algorithm's correct behavior. Previous work has focused on static networks with an a priori fix
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd4232ed9e84881359e6ae5efc4b855f
https://doi.org/10.1016/j.ic.2021.104856
Zobrazit plný text záznamu
3
Polynomial interrupt timed automata: Verification and expressiveness
Autor: Mathieu Sassolas, Claudine Picaronny, Serge Haddad, M. Safey El Din, Béatrice Bérard
Publikováno v: Information and Computation
Information and Computation, 2021, 277, pp.104580. ⟨10.1016/j.ic.2020.104580⟩
Information and Computation, Elsevier, 2021, 277, pp.104580. ⟨10.1016/j.ic.2020.104580⟩
Interrupt Timed Automata ( ITA ) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. H
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8243a078646c144446489598964494c
https://hal.sorbonne-universite.fr/hal-02862629
Zobrazit plný text záznamu
5
Integrating Simulink Models into the Model Checker Cosmos
Autor: Béatrice Bérard, Benoît Barbot, Serge Haddad, Yann Duplouy
Publikováno v: Application and Theory of Petri Nets and Concurrency-Petri Nets 2018
39th International Conference on Applications and Theory of Petri Nets and Concurrency
39th International Conference on Applications and Theory of Petri Nets and Concurrency, Jun 2018, Bratislava, Slovakia. pp.363-373, ⟨10.1007/978-3-319-91268-4_19⟩
Application and Theory of Petri Nets and Concurrency ISBN: 9783319912677
Petri Nets
We present an implementation for Simulink model executions in the statistical model-checker Cosmos.We take profit of this implementation for an hybrid modeling combining Petri nets and Simulink models.
Nous présentons une implémentation pour l
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1340252569015394247f3030807f53ff
https://hal.archives-ouvertes.fr/hal-01916467
Zobrazit plný text záznamu
6
Opacity for linear constraint Markov chains
Autor: Olga Kouchnarenko, Mathieu Sassolas, John Mullins, Béatrice Bérard
Publikováno v: Discrete Event Dynamic Systems
Discrete Event Dynamic Systems, Springer Verlag, 2018, 28 (1), pp.83-108. ⟨10.1007/s10626-017-0259-4⟩
[Research Report] LIP6 UMR 7606 UPMC Sorbonne Universités, France; Univ. de Franche-Comté; Ecole Polytechnique de Montréal; LACL, Université Paris-Est. 2016
On a partially observed system, a secret ϕ is opaque if an observer cannot ascertain that its trace belongs to ϕ. We consider specifications given as Constraint Markov Chains (CMC), which are underspec-ified Markov chains where probabilities on edg
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2aa6a8d3499aa45d49e08956cc0955c
https://hal.sorbonne-universite.fr/hal-02077787
Zobrazit plný text záznamu
7
Elektronická kniha
Perversion - Variations sur un thème
Autor: Béatrice Bérard, Lydie Camus, Laurent Koelblen, Marie-Sarah Néjadi, Dorit Perl, Christine Zimamou-Prigent
La perversion reste une question encore difficile à appréhender à notre époque. À partir de synthèses de romans, films et faits divers, ce livre interroge huit concepts sur leur versant psychanalytique : le couple pervers, le fétiche, le fanta
Zobrazit plný text záznamu
8
The Complexity of Diagnosability and Opacity Verification for Petri Nets
Autor: Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon
Publikováno v: Petri nets 2017-38th International Conference on Applications and Theory of Petri Nets and Concurrency
Petri nets 2017-38th International Conference on Applications and Theory of Petri Nets and Concurrency, Jun 2017, Zaragoza, Spain. pp.200--220, ⟨10.1007/978-3-319-57861-3_13⟩
Fundamenta Informaticae
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2018, 161 (4), pp.317--349. ⟨10.3233/FI-2018-1706⟩
Fundamenta Informaticae, 2018, 161 (4), pp.317--349. ⟨10.3233/FI-2018-1706⟩
Application and Theory of Petri Nets and Concurrency ISBN: 9783319578606
Petri Nets
International audience; Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues. We first relate different notions of diagnosability and op
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de289f3c82bfbe80ba598c6d7f06b1c8
https://hal.inria.fr/hal-01484476v2/document
Zobrazit plný text záznamu
9
Non-interference in partial order models
Autor: John Mullins, Loïc Hélouët, Béatrice Bérard
Publikováno v: ACM Transactions on Embedded Computing Systems (TECS)
ACM Transactions on Embedded Computing Systems (TECS), 2017, Application and Theory of Petri Nets and Other Models of Concurrency: Special Issue of Selected Papers from Petri Nets 2015, 16 (2), pp.44:1-44:34. ⟨10.1145/2984639⟩
ACM Transactions on Embedded Computing Systems (TECS), ACM, 2017, Application and Theory of Petri Nets and Other Models of Concurrency: Special Issue of Selected Papers from Petri Nets 2015, 16 (2), pp.44:1-44:34. ⟨10.1145/2984639⟩
ACSD'15-15th International Conference on Application of Concurrency to System Design
ACSD'15-15th International Conference on Application of Concurrency to System Design, Jun 2015, Brussels, Belgium. pp.80-89, ⟨10.1109/ACSD.2015.11⟩
ACSD
Non-interference (NI) is a property of systems stating that confidential actions should not cause effects observable by unauthorized users. Several variants of NI have been studied for many types of models but rarely for true concurrency or unbounded
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0953453ca43473c798d9b5bb7626e688
https://inria.hal.science/hal-01379451/file/bhm-TECS.pdf
Zobrazit plný text záznamu
10
Timed Model‐Checking
Autor: Béatrice Bérard
Publikováno v: Communicating Embedded Systems: Software and Design: Formal Methods
Communicating Embedded Systems--Software and Design
Communicating Embedded Systems--Software and Design, ISTE Publishing / John Wiley, 2009, 978-1-8482-1143-8. ⟨10.1002/9781118558188.ch2⟩
International audience
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e884a44171f7531104cec56811f5d841
https://doi.org/10.1002/9781118558188.ch2
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje