Béatrice Bérard

According to our database1, Béatrice Bérard
  • authored at least 57 papers between 1986 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Non-interference in Partial Order Models.
ACM Trans. Embedded Comput. Syst., 2017

The Complexity of Diagnosability and Opacity Verification for Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2017

2016
Interrupt Timed Automata with Auxiliary Clocks and Parameters.
Fundam. Inform., 2016

Formal verification of mobile robot protocols.
Distributed Computing, 2016

Preserving opacity on Interval Markov Chains under simulation.
Proceedings of the 13th International Workshop on Discrete Event Systems, 2016

2015
Quantifying opacity.
Mathematical Structures in Computer Science, 2015

Probabilistic opacity for Markov decision processes.
Inf. Process. Lett., 2015

Probabilistic Opacity in Refinement-Based Modeling.
CoRR, 2015

Polynomial Interrupt Timed Automata.
CoRR, 2015

Polynomial Interrupt Timed Automata.
Proceedings of the Reachability Problems - 9th International Workshop, 2015

Non-interference in Partial Order Models.
Proceedings of the 15th International Conference on Application of Concurrency to System Design, 2015

2014
Controllability for discrete event systems modelled in VeriJ.
IJCCBS, 2014

Verification of Information Flow Properties under Rational Observation.
ECEASST, 2014

Verification of Information Flow Properties under Rational Observation.
CoRR, 2014

Interrupt Timed Automata with Auxiliary Clocks and Parameters.
CoRR, 2014

Probabilistic Opacity for Markov Decision Processes.
CoRR, 2014

Channel Synthesis Revisited.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
The expressive power of time Petri nets.
Theor. Comput. Sci., 2013

Quantifying Opacity
CoRR, 2013

Parametric Interrupt Timed Automata.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

Semi-automatic controller design of Java-like models.
Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs, 2013

2012
Channel Synthesis for Finite Transducers.
Int. J. Found. Comput. Sci., 2012

Interrupt Timed Automata: verification and expressiveness.
Formal Methods in System Design, 2012

Interrupt Timed Automata: verification and expressiveness
CoRR, 2012

Concurrent Games on VASS with Inhibition.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Channel Synthesis for Finite Transducers.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
Verification of a Timed Multitask System With Uppaal.
IEEE Trans. Automation Science and Engineering, 2010

Automated controllability and synthesis with hierarchical set decision diagrams.
Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

Real Time Properties for Interrupt Timed Automata.
Proceedings of the TIME 2010, 2010

Quantifying Opacity.
Proceedings of the QEST 2010, 2010

2009
Interrupt Timed Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

2008
When are Timed Automata weakly timed bisimilar to Time Petri Nets?
Theor. Comput. Sci., 2008

2007
Timed substitutions for regular signal-event languages.
Formal Methods in System Design, 2007

2006
Refinements and Abstractions of Signal-Event (Timed) Languages.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Intersection of Regular Signal-Event (Timed) Languages.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Timed Temporal Logics for Abstracting Transient States.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Comparison of the Expressiveness of Timed Automata and Time Petri Nets.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

A New Modality for Almost Everywhere Properties in Timed Automata.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Comparison of Different Semantics for Time Petri Nets.
Proceedings of the Automated Technology for Verification and Analysis, 2005

2003
Compared Study of Two Correctness Proofs for the Standardized.
Formal Methods in System Design, 2003

2001
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages.
Distributed Computing, 2001

Systems and software verification: model checking techniques and tools.
Springer, ISBN: 9783540415237, 2001

2000
Timed automata and additive clock constraints.
Inf. Process. Lett., 2000

Accepting Zeno words: a way toward timed refinements.
Acta Inf., 2000

Verifying Performance Equivalence for Timed Basic Parallel Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2000

1999
A New Rewrite Method for Convergence of Self-Stabilizing Systems.
Proceedings of the Distributed Computing, 1999

Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol.
Proceedings of the Computer Aided Verification, 11th International Conference, 1999

1998
Characterization of the Expressive Power of Silent Transitions in Timed Automata.
Fundam. Inform., 1998

1997
Accepting Zeno Words Without Making Time Stand Still.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996
On the Power of Non-Observable Actions in Timed Automata.
Proceedings of the STACS 96, 1996

1995
Untiming Timed Languages.
Inf. Process. Lett., 1995

1994
Global Serializability of Concurrent Programs.
Theor. Comput. Sci., 1994

1987
Literal Shuffle.
Theor. Comput. Sci., 1987

Formal properties of literal shuffle.
Acta Cybern., 1987

1986
On the Equivalence of Synchronization Sets.
Proceedings of the CAAP '86, 1986


  Loading...