| 2025 | ICALP | A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed Words. | Philippe Schnoebelen, Julien Veron, Isa Vialard |
| 2024 | SOFSEM | On the Piecewise Complexity of Words and Periodic Words. | M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard |
| 2021 | CSL | On Flat Lossy Channel Machines. | Philippe Schnoebelen |
| 2017 | LICS | Decidability, complexity, and expressiveness of first-order logic over the subword ordering. | Simon Halfon, Philippe Schnoebelen, Georg Zetzsche |
| 2017 | MFCS | Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk). | Philippe Schnoebelen |
| 2016 | CSL | The Height of Piecewise-Testable Languages with Applications in Logical Complexity. | Prateek Karandikar, Philippe Schnoebelen |
| 2013 | CONCUR | The Power of Priority Channel Systems. | Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen |
| 2013 | CONCUR | The Power of Well-Structured Systems. | Sylvain Schmitz, Philippe Schnoebelen |
| 2012 | CSR | Cutting through Regular Post Embedding Problems. | Prateek Karandikar, Philippe Schnoebelen |
| 2012 | LICS | The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. | Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen |
| 2011 | ICALP | Multiply-Recursive Upper Bounds with Higman's Lemma. | Sylvain Schmitz, Philippe Schnoebelen |
| 2011 | LICS | Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. | Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen |
| 2010 | DLT | Computing Blocker Sets for the Regular Post Embedding Problem. | Pierre Chambart, Philippe Schnoebelen |
| 2010 | FOSSACS | Toward a Compositional Theory of Leftist Grammars and Transformations. | Pierre Chambart, Philippe Schnoebelen |
| 2010 | ICALP | Pumping and Counting on the Regular Post Embedding Problem. | Pierre Chambart, Philippe Schnoebelen |
| 2010 | MFCS | Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. | Philippe Schnoebelen |
| 2008 | CONCUR | Mixing Lossy and Perfect Fifo Channels. | Pierre Chambart, Philippe Schnoebelen |
| 2008 | FOSSACS | The omega-Regular Post Embedding Problem. | Pierre Chambart, Philippe Schnoebelen |
| 2008 | LICS | The Ordinal Recursive Complexity of Lossy Channel Systems. | Pierre Chambart, Philippe Schnoebelen |
| 2008 | STACS | On Termination for Faulty Channel Machines. | Patricia Bouyer, Nicolas Markey, Jol Ouaknine, Philippe Schnoebelen, James Worrell |
| 2007 | TIME | Model Checking Branching Time Logics. | Philippe Schnoebelen |
| 2006 | FORTE | Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. | Christel Baier, Nathalie Bertrand, Philippe Schnoebelen |
| 2006 | LPAR | On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. | Christel Baier, Nathalie Bertrand, Philippe Schnoebelen |
| 2005 | ATVA | Flat Acceleration in Symbolic Model Checking. | Sbastien Bardin, Alain Finkel, Jrme Leroux, Philippe Schnoebelen |
| 2004 | CONCUR | A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. | Antonn Kucera, Philippe Schnoebelen |
| 2004 | CONCUR | Model Checking Timed Automata with One or Two Clocks. | Franois Laroussinie, Nicolas Markey, Philippe Schnoebelen |
| 2003 | CONCUR | Model Checking a Path. | Nicolas Markey, Philippe Schnoebelen |
| 2003 | FOSSACS | Model Checking Lossy Channels Systems Is Probably Decidable. | Nathalie Bertrand, Philippe Schnoebelen |
| 2003 | ICALP | Oracle Circuits for Branching-Time Model Checking. | Philippe Schnoebelen |
| 2002 | AiML | The Complexity of Temporal Logic Model Checking. | Philippe Schnoebelen |
| 2002 | FOSSACS | On Model Checking Durational Kripke Structures. | Franois Laroussinie, Nicolas Markey, Philippe Schnoebelen |
| 2002 | LICS | Temporal Logic with Forgettable Past. | Franois Laroussinie, Nicolas Markey, Philippe Schnoebelen |
| 2002 | MFCS | On Verifying Fair Lossy Channel Systems. | Benot Masson, Philippe Schnoebelen |
| 2002 | STACS | A Parametric Analysis of the State Explosion Problem in Model Checking. | Stphane Demri, Franois Laroussinie, Philippe Schnoebelen |
| 2001 | FOSSACS | Model Checking CTL | Franois Laroussinie, Nicolas Markey, Philippe Schnoebelen |
| 2000 | FOSSACS | Verifying Performance Equivalence for Timed Basic Parallel Processes. | Batrice Brard, Anne Labroue, Philippe Schnoebelen |
| 2000 | FOSSACS | The State Explosion Problem from Trace to Bisimulation Equivalence. | Franois Laroussinie, Philippe Schnoebelen |
| 2000 | ICALP | Decidable First-Order Transition Logics for PA-Processes. | Denis Lugiez, Philippe Schnoebelen |
| 2000 | LATIN | On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. | Franois Laroussinie, Philippe Schnoebelen, Mathieu Turuani |
| 2000 | SMC | Towards the automatic verification of PLC programs written in Instruction List. | Graud Canet, Sandrine Couffin, Jean-Jacques Lesage, Antoine Petit, Philippe Schnoebelen |
| 1999 | ICALP | Boundedness of Reset P/T Nets. | Catherine Dufourd, Petr Jancar, Philippe Schnoebelen |
| 1998 | CONCUR | The Regular Viewpoint on PA-Processes. | Denis Lugiez, Philippe Schnoebelen |
| 1998 | ICALP | Reset Nets Between Decidability and Undecidability. | Catherine Dufourd, Alain Finkel, Philippe Schnoebelen |
| 1998 | LATIN | Fundamental Structures in Well-Structured Infinite Transition Systems. | Alain Finkel, Philippe Schnoebelen |
| 1998 | STACS | The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). | Stphane Demri, Philippe Schnoebelen |
| 1997 | PACT | A Formal Framework for the Analysis of Recursive-Parallel Programs. | Olga Kouchnarenko, Philippe Schnoebelen |
| 1994 | STACS | A Hierarchy of Temporal Logics with Past (Extended Abstract). | Franois Laroussinie, Philippe Schnoebelen |
| 1991 | CONCUR | Experiments on Processes with Backtracking. | Philippe Schnoebelen |
| 1990 | ESOP | On the Weak Adequacy of Branching-Time Remporal Logic. | Philippe Schnoebelen, Sophie Pinchinat |