Laurent Fribourg

Eur. J. Control, November, 2023

Training and Generalization Errors for Underparameterized Neural Networks.

[BibT_eX]

[DOI]

Daniel M. Xavier

Ludovic Chamoin

IEEE Control. Syst. Lett., 2023

Proving the Convergence to Limit Cycles using Periodically Decreasing Jacobian Matrix Measures.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Asymptotic error in Euler's method with a constant step size.

[BibT_eX]

[DOI]

Eur. J. Control, 2022

Using Euler's Method to Prove the Convergence of Neural Networks.

[BibT_eX]

[DOI]

IEEE Control. Syst. Lett., 2022

2021

Contract-Based Design of Symbolic Controllers for Safety in Distributed Multiperiodic Sampled-Data Systems.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2021

A topological method for finding invariant sets of continuous systems.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

Constructing invariant tori using guaranteed Euler method.

[BibT_eX]

[DOI]

CoRR, 2021

Assume-guarantee contracts for continuous-time systems.

[BibT_eX]

[DOI]

Autom., 2021

Data-Driven Abstraction of Monotone Systems.

[BibT_eX]

[DOI]

Anas Makdesi

Proceedings of the 3rd Annual Conference on Learning for Dynamics and Control, 2021

Robust optimal periodic control using guaranteed Euler's method.

[BibT_eX]

[DOI]

Proceedings of the 2021 American Control Conference, 2021

Guaranteed Identification of Viscous Friction for a Nonlinear Inverted Pendulum Through Interval Analysis and Set Inversion.

[BibT_eX]

[DOI]

Mohamed Fnadi

Gabriel Ballet

Proceedings of the 2021 American Control Conference, 2021

Efficient Data-Driven Abstraction of Monotone Systems with Disturbances.

[BibT_eX]

[DOI]

Anas Makdesi

Proceedings of the 7th IFAC Conference on Analysis and Design of Hybrid Systems, 2021

An Approximation of Minimax Control using Random Sampling and Symbolic Computation.

[BibT_eX]

[DOI]

Proceedings of the 7th IFAC Conference on Analysis and Design of Hybrid Systems, 2021

Determination of limit cycles using stroboscopic set-valued maps.

[BibT_eX]

[DOI]

Proceedings of the 7th IFAC Conference on Analysis and Design of Hybrid Systems, 2021

2020

Generation of bounded invariants via stroboscopic set-valued maps: Application to the stability analysis of parametric time-periodic systems.

[BibT_eX]

[DOI]

CoRR, 2020

Robust optimal control using dynamic programming and guaranteed Euler's method.

[BibT_eX]

[DOI]

CoRR, 2020

Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method: The Brusselator and biped examples.

[BibT_eX]

[DOI]

CoRR, 2020

Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method (verification challenge).

[BibT_eX]

[DOI]

Proceedings of the ARCH20. 7th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH20), 2020

2019

Verification of an Industrial Asynchronous Leader Election Algorithm Using Abstractions and Parametric Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2019

A symbolic approach to voltage stability and power sharing in time-varying DC microgrids.

[BibT_eX]

[DOI]

Proceedings of the 17th European Control Conference, 2019

LAOCOÖN: A Run-Time Monitoring and Verification Approach for Hardware Trojan Detection.

[BibT_eX]

[DOI]

Proceedings of the 22nd Euromicro Conference on Digital System Design, 2019

Guaranteed Optimal Reachability Control of Reaction-Diffusion Equations Using One-Sided Lipschitz Constants and Model Reduction.

[BibT_eX]

[DOI]

Proceedings of the Cyber Physical Systems. Model-Based Design - 9th International Workshop, 2019

Guaranteed Control of Sampled Switched Systems using Semi-Lagrangian Schemes and One-Sided Lipschitz Constants.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Conference on Decision and Control, 2019

2018

Compositional synthesis of state-dependent switching control.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

An improved algorithm for the control synthesis of nonlinear sampled switched systems.

[BibT_eX]

[DOI]

Alexandre Chapoutot

Formal Methods Syst. Des., 2018

Contract based Design of Symbolic Controllers for Vehicle Platooning.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week), 2018

On the Composition of Discrete and Continuous-time Assume-Guarantee Contracts for Invariance.

[BibT_eX]

[DOI]

Proceedings of the 16th European Control Conference, 2018

Controlled Recurrence of a Biped with Torso.

[BibT_eX]

[DOI]

Proceedings of the Cyber Physical Systems. Model-Based Design - 8th International Workshop, 2018

Contract Based Design of Symbolic Controllers for Interconnected Multiperiodic Sampled-Data Systems.

[BibT_eX]

[DOI]

Proceedings of the 57th IEEE Conference on Decision and Control, 2018

Control Synthesis for Stochastic Switched Systems using the Tamed Euler Method.

[BibT_eX]

[DOI]

Jonathan Vacher

Proceedings of the 6th IFAC Conference on Analysis and Design of Hybrid Systems, 2018

2017

Control Synthesis of Nonlinear Sampled Switched Systems using Euler's Method.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis, 2017

Distributed Control Synthesis Using Euler's Method.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 11th International Workshop, 2017

Euler's Method Applied to the Control of Switched Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

2016

Control of nonlinear switched systems based on validated simulation.

[BibT_eX]

[DOI]

Alexandre Chapoutot

CoRR, 2016

Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 10th International Workshop, 2016

Distributed Synthesis of State-Dependent Switching Control.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 10th International Workshop, 2016

A Topological Method for Finding Invariant Sets of Switched Systems.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control, 2016

2015

Game-based Synthesis of Distributed Controllers for Sampled Switched Systems.

[BibT_eX]

[DOI]

Nicolas Markey

Proceedings of the 2nd International Workshop on Synthesis of Complex Parameters, 2015

Guaranteed control of switched control systems using model order reduction and state-space bisection.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Synthesis of Complex Parameters, 2015

2014

Finite controlled invariants for sampled switched systems.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2014

Toward Parametric Timed Interfaces for Real-Time Components.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1st International Workshop on Synthesis of Continuous Parameters, 2014

Correct-by-design Control Synthesis for Multilevel Converters using State Space Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2nd French Singaporean Workshop on Formal Methods and Applications, 2014

Component-based analysis of hierarchical scheduling using linear hybrid automata.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications, 2014

2013

Parametric Verification and Test Coverage for Hybrid Automata using the inverse Method.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

An extension of the inverse method to probabilistic timed automata.

[BibT_eX]

[DOI]

Jeremy Sproston

Formal Methods Syst. Des., 2013

Stability Controllers for Sampled Switched Systems.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 7th International Workshop, 2013

Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Safety-Critical Systems, 2013

Constructing Attractors of Nonlinear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the 1st French Singaporean Workshop on Formal Methods and Applications, 2013

Control of Switching Systems by Invariance Analysis (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 1st French Singaporean Workshop on Formal Methods and Applications, 2013

Merge and Conquer: State Merging in Parametric Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2013

2012

Robustness Analysis for Scheduling Problems Using the Inverse Method.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Temporal Representation and Reasoning, 2012

Enhancing the Inverse Method with State Merging.

[BibT_eX]

[DOI]

Proceedings of the NASA Formal Methods, 2012

IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the FM 2012: Formal Methods, 2012

2011

Synthesis of Switching Rules for Ensuring Reachability Properties of Sampled Linear Systems

[BibT_eX]

[DOI]

Bertrand Revol

Proceedings of the Proceedings 13th International Workshop on Verification of Infinite-State Systems, 2011

2010

Behavioral Cartography of Timed Automata.

[BibT_eX]

[DOI]

Emmanuelle Encrenaz-Tiphène

Proceedings of the Reachability Problems, 4th International Workshop, 2010

2009

Timed verification of the generic architecture of a memory circuit using parametric timed automata.

[BibT_eX]

[DOI]

Remy Chevallier

Weiwen Xu

Formal Methods Syst. Des., 2009

An Inverse Method for Policy-Iteration Based Algorithms

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on Verification of Infinite-State Systems, 2009

2008

An Inverse Method for Parametric Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

2006

Time Separation of Events: An Inverse Method.

[BibT_eX]

[DOI]

Emmanuelle Encrenaz

Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory, 2006

Coupling and self-stabilization.

[BibT_eX]

[DOI]

Emmanuelle Encrenaz-Tiphène

Stéphane Messika

Claudine Picaronny

Distributed Comput., 2006

Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata.

[BibT_eX]

[DOI]

Remy Chevallier

Weiwen Xu

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

2005

Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers.

[BibT_eX]

[DOI]

Stéphane Messika

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004

Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC.

[BibT_eX]

[DOI]

Proceedings of the Fouth International Workshop on Automated Verification of Critical Systems, 2004

Randomized dining philosophers without fairness assumption.

[BibT_eX]

[DOI]

Marie Duflot

Claudine Picaronny

Distributed Comput., 2004

2003

Compared Study of Two Correctness Proofs for the Standardized.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2003

2001

Proving convergence of self-stabilizing systems using first-order rewriting and regular languages.

[BibT_eX]

[DOI]

Distributed Comput., 2001

Randomized Finite-State Distributed Algorithms as Markov Chains.

[BibT_eX]

[DOI]

Marie Duflot

Claudine Picaronny

Proceedings of the Distributed Computing, 15th International Conference, 2001

Unavoidable Configurations of Parameterized Rings of Processes.

[BibT_eX]

[DOI]

Marie Duflot

Ulf Nilsson

Proceedings of the CONCUR 2001, 2001

2000

Petri Nets, Flat Languages and Linear Arithmetic.

[BibT_eX]

Proceedings of the 9th International Workshop on Functional and Logic Programming, 2000

1999

A New Rewrite Method for Convergence of Self-Stabilizing Systems.

[BibT_eX]

[DOI]

Joffroy Beauquier

Béatrice Bérard

Proceedings of the Distributed Computing, 1999

Constraint Logic Programming Applied to Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1999

Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic.

[BibT_eX]

[DOI]

Béatrice Bérard

Proceedings of the CONCUR '99: Concurrency Theory, 1999

Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol.

[BibT_eX]

[DOI]

Béatrice Bérard

Proceedings of the Computer Aided Verification, 11th International Conference, 1999

1998

Unfolding Parametric Automata.

[BibT_eX]

[DOI]

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997

Reachability sets of parameterized rings as regular languages.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on Verification of Infinite State Systems, 1997

A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters.

[BibT_eX]

[DOI]

Constraints An Int. J., 1997

Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996

Symbolic Verification with Gap-Order Constraints.

[BibT_eX]

[DOI]

Julian Richardson

Proceedings of the Logic Programming Synthesis and Transformation, 1996

Reductions of Petri Nets and Unfolding of Propositional Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1996

1994

Bottom-Up Evaluation of Datalog Programs with Incremental Arguments and Linear Arithmetic Constraints.

[BibT_eX]

Proceedings of the ILPS 1994, 1994

Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993

Concurrent Constraint Automata.

[BibT_eX]

Proceedings of the Logic Programming, 1993

1992

A Unifying View of Structural Induction and Computation Induction for Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic Program Synthesis and Transformation, 1992

Mixing List Recursion and Arithmetic

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991

Automatic Generation of Simplification Lemmas for Inductive Proofs.

[BibT_eX]

Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 1991

Efficient Integration of Simplifications into Prolog.

[BibT_eX]

[DOI]

P. H. Cheong

Proceedings of the Programming Language Implementation and Logic Programming, 1991

A Survey of the Implementations of Narrowing.

[BibT_eX]

[DOI]

P. H. Cheong

Proceedings of the Declarative Programming, 1991

Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction.

[BibT_eX]

Proceedings of the Constructing Logic Programs, 1991

1990

A New Presburger Arithmetic Decision Procedure Based on Extended Prolog Execution.

[BibT_eX]

[DOI]

Proceedings of the Programming Language Implementation and Logic Programming, 1990

1989

A Strong Restriction of the Inductive Completion Procedure.

[BibT_eX]

[DOI]

J. Symb. Comput., 1989

1988

Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs.

[BibT_eX]

Proceedings of the Logic Programming, 1988

Functional Extensions to Prolog: Are they Needed?

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 1988

1987

SLOG: A Logic Interpreter for Equational Clauses.

[BibT_eX]

[DOI]

Proceedings of the STACS 87, 1987

List concatenation via extended unification.

[BibT_eX]

Proceedings of the SPLT'87, 1987

On the Use of Conditional Rewrite Rules in Inductive Theorem Proving.

[BibT_eX]

[DOI]

Proceedings of the Conditional Term Rewriting Systems, 1987

1986

Test sets generation from algebraic specifications using logic programming.

[BibT_eX]

[DOI]

J. Syst. Softw., 1986

1985

A Superposition Oriented Theorem Prover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Application of Prolog to Test Sets Generation from Algebraic Specifications.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Software Development, 1985

SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting.

[BibT_eX]

Proceedings of the 1985 Symposium on Logic Programming, 1985

Handling Function Definitions through Innermost Superposition and Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

Runnable protocol specifications using the logic interpreter SLOG.

[BibT_eX]

N. Choquet

Anne Mauboussin

Proceedings of the Protocol Specification, 1985

1984

Oriented Equational Clauses as a Programming Language.

[BibT_eX]

[DOI]

J. Log. Program., 1984

A Narrowing Procedure for Theories with Constructors.

[BibT_eX]

[DOI]