PETRIREVE: Proving Petri Net Properties with Rewriting Systems. - Christine Choppy; Colette Johnen (RTA, 1985)

PAPETRI: Environment for the Analysis of Petri Nets. - Gérard Berthelot; Colette Johnen; Laure Petrucci (CAV, 1990)

Self-Stabilizing Depth-First Token Passing on Rooted Networks. - Colette Johnen; Gianluigi Alari; Joffroy Beauquier; Ajoy Kumar Datta (WDAG, 1997)

Memory-efficient self-stabilizing algorithm to construct BFS spanning trees. - Colette Johnen (WSS, 1997)

Self-Stabilizing Neighborhood Synchronizer in Tree Networks. - Colette Johnen; Luc Onana Alima; Ajoy Kumar Datta; Sébastien Tixeuil (ICDCS, 1999)

Memory Space Requirements for Self-Stabilizing Leader Election Protocols. - Joffroy Beauquier; Maria Gradinariu; Colette Johnen (PODC, 1999)

Fair and Reliable Self-stabilizing Communication. - Ivan Lavallée; Christian Lavault; Colette Johnen (OPODIS, 2000)

Self-stabilizing depth-first token circulation in arbitrary rooted networks. - Ajoy Kumar Datta; Colette Johnen; Franck Petit; Vincent Villain (Distributed Comput., 2000)

Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler. - Maria Gradinariu; Colette Johnen (Euro-Par, 2001)

A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. - Faith E. Fich; Colette Johnen (DISC, 2001)

Cross-Over Composition - Enforcement of Fairness under Unfair Adversary. - Joffroy Beauquier; Maria Gradinariu; Colette Johnen (WSS, 2001)

Reliable Self-Stabilizing Communication for Quasi Rendezvous. - Colette Johnen; Ivan Lavallée; Christian Lavault (Stud. Inform. Univ., 2001)

Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings. - Colette Johnen (SRDS, 2002)

Token-Based Self-Stabilizing Uniform Algorithms. - Joffroy Beauquier; Maria Gradinariu; Colette Johnen; Jérôme Olivier Durand-Lose (J. Parallel Distributed Comput., 2002)

Optimal Snap-Stabilizing Neighborhood Synchronizer in Tree Networks. - Colette Johnen; Luc Onana Alima; Ajoy Kumar Datta; Sébastien Tixeuil (Parallel Process. Lett., 2002)

Route Preserving Stabilization. - Colette Johnen; Sébastien Tixeuil (Self-Stabilizing Systems, 2003)

Bounded Service Time and Memory Space Optimal Self-Stabilizing Token Circulation Protocol on Unidirectional Rings. - Colette Johnen (IPDPS, 2004)

Autostabilisation et protocoles réseau. - Colette Johnen; Franck Petit; Sébastien Tixeuil (Tech. Sci. Informatiques, 2004)

Strategies for peer-to-peer downloading. - Ted Herman; Colette Johnen (Inf. Process. Lett., 2005)

Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks. - Colette Johnen; Le Huy Nguyen (ALGOSENSORS, 2006)

Relationships between communication models in networks using atomic registers. - Lisa Higham; Colette Johnen (IPDPS, 2006)

Robust Self-stabilizing Clustering Algorithm. - Colette Johnen; Le Huy Nguyen (OPODIS, 2006)

All k -Bounded Policies Are Equivalent for Self-stabilization. - Joffroy Beauquier; Colette Johnen; Stéphane Messika (SSS, 2006)

Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules. - Joffroy Beauquier; Colette Johnen; Stéphane Messika (DISC, 2006)

Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks. - Colette Johnen; Lisa Higham (DISC, 2007)

Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. - Joffroy Beauquier; Maria Gradinariu; Colette Johnen (Distributed Comput., 2007)

Analyze of Probabilistic Algorithms under Indeterministic Scheduler. - Joffroy Beauquier; Colette Johnen (ISPA, 2008)

Self-Stabilizing Construction of Bounded Size Clusters. - Colette Johnen; Le Huy Nguyen (ISPA, 2008)

Fault-tolerant implementations of atomic registers by safe registers in networks. - Colette Johnen; Lisa Higham (PODC, 2008)

Safe peer-to-peer self-downloading. - Kajari Ghosh Dastidar; Ted Herman; Colette Johnen (ACM Trans. Auton. Adapt. Syst., 2008)

Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks. - Colette Johnen; Lisa Higham (ICDCN, 2009)

Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters. - Colette Johnen; Fouzi Mekhaldi (SSS, 2009)

Robust self-stabilizing weight-based clustering algorithm. - Colette Johnen; Le Huy Nguyen (Theor. Comput. Sci., 2009)

Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters. - Colette Johnen; Fouzi Mekhaldi (Euro-Par (1), 2010)

Quantitative model for evaluate routing protocols in a vehicular ad hoc networks on highway. - Florent Kaisser; Colette Johnen; Véronique Vèque (VNC, 2010)

Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc Network. - Colette Johnen; Fouzi Mekhaldi (Euro-Par (1), 2011)

Self-Stabilizing Computation and Preservation of Knowledge of Neighbor Clusters. - Colette Johnen; Fouzi Mekhaldi (SASO, 2011)

From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering. - Colette Johnen; Fouzi Mekhaldi (SSS, 2012)

Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction. - Colette Johnen (SSS, 2013)

Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. - Matthieu Barjon; Arnaud Casteigts; Serge Chaumette; Colette Johnen; Yessin M. Neggaz (OPODIS, 2014)

Solo-Fast Universal Constructions for Deterministic Abortable Objects. - Claire Capdevielle; Colette Johnen; Alessia Milani (DISC, 2014)

Testing Temporal Connectivity in Sparse Dynamic Graphs. - Matthieu Barjon; Arnaud Casteigts; Serge Chaumette; Colette Johnen; Yessin M. Neggaz (CoRR, 2014)

Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densité. - Matthieu Barjon; Arnaud Casteigts; Serge Chaumette; Colette Johnen; Yessin M. Neggaz (CoRR, 2014)

Fast, silent self-stabilizing distance-k independent dominating set construction. - Colette Johnen (Inf. Process. Lett., 2014)

Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters. - Colette Johnen; Fouzi Mekhaldi (J. Parallel Distributed Comput., 2014)

Memory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction. - Colette Johnen (NETYS, 2015)

On the Uncontended Complexity of Anonymous Consensus. - Claire Capdevielle; Colette Johnen; Petr Kuznetsov; Alessia Milani (OPODIS, 2015)

Silent Self-stabilizing BFS Tree Algorithms Revised. - Stéphane Devismes; Colette Johnen (CoRR, 2015)

Polynomial Silent Self-Stabilizing p-Star Decomposition (Short Paper). - Mohammed Haddad 001; Colette Johnen; Sven Köhler 001 (SSS, 2016)

Silent self-stabilizing BFS tree algorithms revisited. - Stéphane Devismes; Colette Johnen (J. Parallel Distributed Comput., 2016)

On the uncontended complexity of anonymous agreement. - Claire Capdevielle; Colette Johnen; Petr Kuznetsov; Alessia Milani (Distributed Comput., 2017)

Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. - Stéphane Devismes; David Ilcinkas; Colette Johnen (Discret. Math. Theor. Comput. Sci., 2017)

On the complexity of basic abstractions to implement consensus. - Claire Capdevielle; Colette Johnen; Alessia Milani (Theor. Comput. Sci., 2018)

Silent self-stabilizing scheme for spanning-tree-like constructions. - Stéphane Devismes; David Ilcinkas; Colette Johnen (ICDCN, 2019)

Self-Stabilizing Distributed Cooperative Reset. - Stéphane Devismes; Colette Johnen (ICDCS, 2019)

Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction. - Ajoy K. Datta; Stéphane Devismes; Colette Johnen; Lawrence L. Larmore (SSS, 2019)

Maintaining a Distributed Spanning Forest in Highly Dynamic Networks. - Matthieu Barjon; Arnaud Casteigts; Serge Chaumette; Colette Johnen; Yessin M. Neggaz (Comput. J., 2019)

Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. - Ajoy K. Datta; Stéphane Devismes; Colette Johnen; Lawrence L. Larmore (CoRR, 2019)

Disconnected components detection and rooted shortest-path tree maintenance in networks. - Christian Glacet; Nicolas Hanusse; David Ilcinkas; Colette Johnen (J. Parallel Distributed Comput., 2019)

Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. - Karine Altisen; Stéphane Devismes; Anaïs Durand; Colette Johnen; Franck Petit (PODC, 2020)

Polynomial Silent Self-Stabilizing p-Star Decomposition†. - Mohammed Haddad 001; Colette Johnen; Sven Köhler 001 (Comput. J., 2020)

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. - Karine Altisen; Stéphane Devismes; Anaïs Durand; Colette Johnen; Franck Petit (PODC, 2021)

FIFO and Atomic broadcast algorithms with bounded message size for dynamic systems. - Colette Johnen; Luciana Arantes; Pierre Sens 001 (SRDS, 2021)

Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers. - Colette Johnen; Adnane Khattabi; Alessia Milani (OPODIS, 2022)

Silent Anonymous Snap-Stabilizing Termination Detection. - Lélia Blin; Colette Johnen; Gabriel Le Bouder; Franck Petit (SRDS, 2022)

Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. - Stéphane Devismes; David Ilcinkas; Colette Johnen (Algorithmica, 2022)

Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. - Stéphane Devismes; David Ilcinkas; Colette Johnen; Frédéric Mazoit (CoRR, 2023)

Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison. - Stéphane Devismes; David Ilcinkas; Colette Johnen; Frédéric Mazoit (CoRR, 2023)

Self-stabilizing systems in spite of high dynamics. - Karine Altisen; Stéphane Devismes; Anaïs Durand; Colette Johnen; Franck Petit (Theor. Comput. Sci., 2023)

Analysis of a memory-efficient self-stabilizing BFS spanning tree construction. - Ajoy K. Datta; Stéphane Devismes; Colette Johnen; Lawrence L. Larmore (Theor. Comput. Sci., 2023)

Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. - Colette Johnen; Stéphane Devismes; Frédéric Mazoit; David Ilcinkas (PODC, 2024)

Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. - Colette Johnen; Adnane Khattabi; Alessia Milani; Jennifer L. Welch (SIROCCO, 2024)

Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences. - Stéphane Devismes; David Ilcinkas; Colette Johnen; Frédéric Mazoit (STACS, 2025)