Béatrice Bérard

Available identifiers

zbMath Open berard.beatriceMaRDI QIDQ453511

List of research outcomes

Publication	Date of Publication	Type
Synthesis in presence of dynamic links	2022-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5090956	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5079750	2022-05-28	Paper
https://portal.mardi4nfdi.de/entity/Q5020999	2022-01-11	Paper
Revisiting reachability in polynomial interrupt timed automata	2021-12-14	Paper
Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata	2021-12-14	Paper
Polynomial interrupt timed automata: verification and expressiveness	2021-04-13	Paper
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages	2020-12-03	Paper
https://portal.mardi4nfdi.de/entity/Q5136302	2020-11-25	Paper
Parameterized synthesis for fragments of first-order logic over data words	2020-09-23	Paper
The Complexity of Diagnosability and Opacity Verification for Petri Nets	2018-10-02	Paper
The complexity of diagnosability and opacity verification for Petri nets	2018-08-20	Paper
Opacity for linear constraint Markov chains	2018-04-18	Paper
On the power of non-observable actions in timed automata	2017-11-16	Paper
Polynomial interrupt timed automata	2017-10-27	Paper
Formal verification of mobile robot protocols	2017-06-22	Paper
Interrupt Timed Automata with Auxiliary Clocks and Parameters*	2017-03-16	Paper
Quantifying opacity	2016-07-27	Paper
https://portal.mardi4nfdi.de/entity/Q5740413	2016-07-26	Paper
An Introduction to Timed Automata	2015-01-29	Paper
Petri Nets with Time	2015-01-29	Paper
Probabilistic opacity for Markov decision processes	2014-10-07	Paper
Parametric Interrupt Timed Automata	2014-07-07	Paper
Channel Synthesis Revisited	2014-03-31	Paper
CHANNEL SYNTHESIS FOR FINITE TRANSDUCERS	2013-06-06	Paper
The expressive power of time Petri nets	2013-03-27	Paper
Interrupt timed automata: verification and expressiveness	2012-09-27	Paper
Concurrent Games on VASS with Inhibition	2012-09-25	Paper
Interrupt Timed Automata	2009-03-31	Paper
When are timed automata weakly timed bisimilar to time Petri nets?	2008-09-16	Paper
Timed Temporal Logics for Abstracting Transient States	2008-09-04	Paper
Intersection of Regular Signal-Event (Timed) Languages	2008-07-08	Paper
Refinements and Abstractions of Signal-Event (Timed) Languages	2008-07-08	Paper
Timed substitutions for regular signal-event languages	2007-10-11	Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science	2006-11-14	Paper
Formal Modeling and Analysis of Timed Systems	2006-11-14	Paper
CONCUR 2005 – Concurrency Theory	2006-11-01	Paper
Automated Technology for Verification and Analysis	2006-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q4817536	2004-09-24	Paper
A compared study of two correctness proofs for the standardized algorithm of ABR conformance	2003-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q4508291	2001-01-17	Paper
Timed automata and additive clock constraints	2000-10-26	Paper
Accepting zeno words: A way toward timed refinements	2000-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q4270057	1999-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q4699292	1999-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q4264103	1999-09-16	Paper
Untiming timed languages	1997-02-27	Paper
Global serializability of concurrent programs	1994-04-05	Paper
Literal shuffle	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4728261	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3740263	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3742747	1986-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Béatrice Bérard