Specification of a Pipelined Event Driven Simulator using FP2. - Peter Schäfer; Philippe Schnoebelen (PARLE (1), 1987)

Rewriting Techniques for the Temporal Analysis of Communicating Processes. - Philippe Schnoebelen (PARLE (2), 1987)

Refined Compilation of Pattern-Matching for Functional Languages. - Philippe Schnoebelen (Sci. Comput. Program., 1988)

On the Weak Adequacy of Branching-Time Remporal Logic. - Philippe Schnoebelen; Sophie Pinchinat (ESOP, 1990)

Experiments on Processes with Backtracking. - Philippe Schnoebelen (CONCUR, 1991)

Strong Bisimilarity on Nets Revisited. - Cyril Autant; Z. Belmesk; Philippe Schnoebelen (PARLE (2), 1991)

τ-Bisimulations and Full Abstraction for Refinement of Actions. - Ferroudja Cherief; Philippe Schnoebelen (Inf. Process. Lett., 1991)

A Rewrite-Based Type Discipline for a Subset of Computer Algebra. - Hubert Comon; Denis Lugiez; Philippe Schnoebelen (J. Symb. Comput., 1991)

Place Bisimulations in Petri Nets. - Cyril Autant; Philippe Schnoebelen (Application and Theory of Petri Nets, 1992)

Translation Results for Modal Logics of Reactive Systems. - François Laroussinie; Sophie Pinchinat; Philippe Schnoebelen (AMAST, 1993)

A Hierarchy of Temporal Logics with Past (Extended Abstract). - François Laroussinie; Philippe Schnoebelen (STACS, 1994)

Translations Between Modal Logics of Reactive Systems. - François Laroussinie; Sophie Pinchinat; Philippe Schnoebelen (Theor. Comput. Sci., 1995)

A Hierarchy of Temporal Logics with Past. - François Laroussinie; Philippe Schnoebelen (Theor. Comput. Sci., 1995)

A model for recursive-parallel programs. - Olga Kouchnarenko; Philippe Schnoebelen (INFINITY, 1996)

A Formal Framework for the Analysis of Recursive-Parallel Programs. - Olga Kouchnarenko; Philippe Schnoebelen (PaCT, 1997)

Specification in CTL+Past, verification in CTL. - François Laroussinie; Philippe Schnoebelen (EXPRESS, 1997)

Reset Nets Between Decidability and Undecidability. - Catherine Dufourd; Alain Finkel; Philippe Schnoebelen (ICALP, 1998)

Fundamental Structures in Well-Structured Infinite Transition Systems. - Alain Finkel; Philippe Schnoebelen (LATIN, 1998)

The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). - Stéphane Demri; Philippe Schnoebelen (STACS, 1998)

Some Decidability Results for Nested Petri Nets. - Irina A. Lomazova; Philippe Schnoebelen (Ershov Memorial Conference, 1999)

Boundedness of Reset P/T Nets. - Catherine Dufourd; Petr Jancar; Philippe Schnoebelen (ICALP, 1999)

Bisimulation and the Reduction of Petri Nets. - Philippe Schnoebelen; Natalia Sidorova (ICATPN, 2000)

Verifying Performance Equivalence for Timed Basic Parallel Processes. - Béatrice Bérard; Anne Labroue; Philippe Schnoebelen (FoSSaCS, 2000)

The State Explosion Problem from Trace to Bisimulation Equivalence. - François Laroussinie; Philippe Schnoebelen (FoSSaCS, 2000)

Towards the automatic verification of PLC programs written in Instruction List. - Géraud Canet; Sandrine Couffin; Jean-Jacques Lesage; Antoine Petit 001; Philippe Schnoebelen (SMC, 2000)

Systems and Software Verification, Model-Checking Techniques and Tools. - Béatrice Bérard; Michel Bidoit; Alain Finkel; François Laroussinie; Antoine Petit 001; Laure Petrucci; Philippe Schnoebelen; Pierre McKenzie (Springer, 2001)

Model Checking CTL+ and FCTL is Hard. - François Laroussinie; Nicolas Markey; Philippe Schnoebelen (FoSSaCS, 2001)

Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. - Philippe Schnoebelen (TACS, 2001)

Well-structured transition systems everywhere! - Alain Finkel; Philippe Schnoebelen (Theor. Comput. Sci., 2001)

The Complexity of Temporal Logic Model Checking. - Philippe Schnoebelen (Advances in Modal Logic, 2002)

On Solving Temporal Logic Queries. - Samuel Hornus; Philippe Schnoebelen (AMAST, 2002)

On Model Checking Durational Kripke Structures. - François Laroussinie; Nicolas Markey; Philippe Schnoebelen (FoSSaCS, 2002)

Temporal Logic with Forgettable Past. - François Laroussinie; Nicolas Markey; Philippe Schnoebelen (LICS, 2002)

On Verifying Fair Lossy Channel Systems. - Benoît Masson; Philippe Schnoebelen (MFCS, 2002)

The Complexity of Propositional Linear Temporal Logics in Simple Cases. - Stéphane Demri; Philippe Schnoebelen (Inf. Comput., 2002)

Verifying lossy channel systems has nonprimitive recursive complexity. - Philippe Schnoebelen (Inf. Process. Lett., 2002)

An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. - Anne Labroue; Philippe Schnoebelen (Nord. J. Comput., 2002)

The regular viewpoint on PA-processes. - Denis Lugiez; Philippe Schnoebelen (Theor. Comput. Sci., 2002)

Model Checking a Path. - Nicolas Markey; Philippe Schnoebelen (CONCUR, 2003)

Model Checking Lossy Channels Systems Is Probably Decidable. - Nathalie Bertrand 001; Philippe Schnoebelen (FoSSaCS, 2003)

Oracle Circuits for Branching-Time Model Checking. - Philippe Schnoebelen (ICALP, 2003)

Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003. - Philippe Schnoebelen (INFINITY, 2003)

On the expressivity and complexity of quantitative branching-time temporal logics. - François Laroussinie; Philippe Schnoebelen; Mathieu Turuani (Theor. Comput. Sci., 2003)

Model Checking Timed Automata with One or Two Clocks. - François Laroussinie; Nicolas Markey; Philippe Schnoebelen (CONCUR, 2004)

Symbolic Model Checking for Simply-Timed Systems. - Nicolas Markey; Philippe Schnoebelen (FORMATS/FTRTFT, 2004)

TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems. - Nicolas Markey; Philippe Schnoebelen (QEST, 2004)

The Verification of Probabilistic Lossy Channel Systems. - Philippe Schnoebelen (Validation of Stochastic Systems, 2004)

A PTIME-complete matching problem for SLP-compressed words. - Nicolas Markey; Philippe Schnoebelen (Inf. Process. Lett., 2004)

Flat Acceleration in Symbolic Model Checking. - Sébastien Bardin; Alain Finkel; Jérôme Leroux; Philippe Schnoebelen (ATVA, 2005)

Verifying nondeterministic probabilistic channel systems against $ omega$-regular linear-time properties - Christel Baier; Nathalie Bertrand 001; Philippe Schnoebelen (CoRR, 2005)

A Short Visit to the STS Hierarchy. - Nathalie Bertrand 001; Philippe Schnoebelen (EXPRESS, 2005)

Verification of probabilistic systems with faulty communication. - Parosh Aziz Abdulla; Nathalie Bertrand 001; Alexander Moshe Rabinovich; Philippe Schnoebelen (Inf. Comput., 2005)

Decidable first-order transition logics for PA-processes. - Denis Lugiez; Philippe Schnoebelen (Inf. Comput., 2005)

Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. - Christel Baier; Nathalie Bertrand 001; Philippe Schnoebelen (FORTE, 2006)

On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. - Christel Baier; Nathalie Bertrand 001; Philippe Schnoebelen (LPAR, 2006)

BTL2 and the expressive power of ECTL+. - Alexander Rabinovich; Philippe Schnoebelen (Inf. Comput., 2006)

A note on the attractor-property of infinite-state Markov chains. - Christel Baier; Nathalie Bertrand 001; Philippe Schnoebelen (Inf. Process. Lett., 2006)

Mu-calculus path checking. - Nicolas Markey; Philippe Schnoebelen (Inf. Process. Lett., 2006)

A parametric analysis of the state-explosion problem in model checking. - Stéphane Demri; François Laroussinie; Philippe Schnoebelen (J. Comput. Syst. Sci., 2006)

A general approach to comparing infinite-state systems with their finite-state specifications. - Antonín Kucera 001; Philippe Schnoebelen (Theor. Comput. Sci., 2006)

Efficient timed model checking for discrete-time systems. - François Laroussinie; Nicolas Markey; Philippe Schnoebelen (Theor. Comput. Sci., 2006)

Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. - Pierre Chambart; Philippe Schnoebelen (FSTTCS, 2007)

Model Checking Branching Time Logics. - Philippe Schnoebelen (TIME, 2007)

Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. - Christel Baier; Nathalie Bertrand 001; Philippe Schnoebelen (ACM Trans. Comput. Log., 2007)

Mixing Lossy and Perfect Fifo Channels. - Pierre Chambart; Philippe Schnoebelen (CONCUR, 2008)

The omega-Regular Post Embedding Problem. - Pierre Chambart; Philippe Schnoebelen (FoSSaCS, 2008)

The Ordinal Recursive Complexity of Lossy Channel Systems. - Pierre Chambart; Philippe Schnoebelen (LICS, 2008)

On Termination for Faulty Channel Machines. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; Philippe Schnoebelen; James Worrell 001 (STACS, 2008)

Computing Blocker Sets for the Regular Post Embedding Problem. - Pierre Chambart; Philippe Schnoebelen (Developments in Language Theory, 2010)

Toward a Compositional Theory of Leftist Grammars and Transformations. - Pierre Chambart; Philippe Schnoebelen (FoSSaCS, 2010)

Pumping and Counting on the Regular Post Embedding Problem. - Pierre Chambart; Philippe Schnoebelen (ICALP (2), 2010)

Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. - Philippe Schnoebelen (MFCS, 2010)

Lossy Counter Machines Decidability Cheat Sheet. - Philippe Schnoebelen (RP, 2010)

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma - Diego Figueira; Santiago Figueira; Sylvain Schmitz; Philippe Schnoebelen (CoRR, 2010)

Multiply-Recursive Upper Bounds with Higman's Lemma. - Sylvain Schmitz; Philippe Schnoebelen (ICALP (2), 2011)

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. - Diego Figueira; Santiago Figueira; Sylvain Schmitz; Philippe Schnoebelen (LICS, 2011)

Cutting through Regular Post Embedding Problems. - Prateek Karandikar; Philippe Schnoebelen (CSR, 2012)

Unidirectional Channel Systems Can Be Tested. - Petr Jancar; Prateek Karandikar; Philippe Schnoebelen (IFIP TCS, 2012)

The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. - Serge Haddad; Sylvain Schmitz; Philippe Schnoebelen (LICS, 2012)

On termination and invariance for faulty channel machines. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; Philippe Schnoebelen; James Worrell 001 (Formal Aspects Comput., 2012)

The Power of Well-Structured Systems. - Sylvain Schmitz; Philippe Schnoebelen (CONCUR, 2013)

On the index of Simon's congruence for piecewise testability. - Prateek Karandikar; Philippe Schnoebelen (CoRR, 2013)

Solving Stochastic Büchi Games on Infinite Decisive Arenas. - Nathalie Bertrand 001; Philippe Schnoebelen (QAPL, 2013)

Computable fixpoints in well-structured symbolic model checking. - Nathalie Bertrand 001; Philippe Schnoebelen (Formal Methods Syst. Des., 2013)

On the State Complexity of Closures and Interiors of Regular Languages with Subwords. - Prateek Karandikar; Philippe Schnoebelen (DCFS, 2014)

On Functions Weakly Computable by Petri Nets and Vector Addition Systems. - Jérôme Leroux; Philippe Schnoebelen (RP, 2014)

The Power of Priority Channel Systems - Christoph Haase; Sylvain Schmitz; Philippe Schnoebelen (Log. Methods Comput. Sci., 2014)

Decidability in the Logic of Subsequences and Supersequences. - Prateek Karandikar; Philippe Schnoebelen (FSTTCS, 2015)

On Reachability for Unidirectional Channel Systems Extended with Regular Tests. - Petr Jancar; Prateek Karandikar; Philippe Schnoebelen (Log. Methods Comput. Sci., 2015)

Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences. - Prateek Karandikar; Philippe Schnoebelen (CoRR, 2015)

On the index of Simon's congruence for piecewise testability. - Prateek Karandikar; Manfred Kufleitner; Philippe Schnoebelen (Inf. Process. Lett., 2015)

Generalized Post Embedding Problems. - Prateek Karandikar; Philippe Schnoebelen (Theory Comput. Syst., 2015)

The Height of Piecewise-Testable Languages with Applications in Logical Complexity. - Prateek Karandikar; Philippe Schnoebelen (CSL, 2016)

On the state complexity of closures and interiors of regular languages with subwords and superwords. - Prateek Karandikar; Matthias Niewerth; Philippe Schnoebelen (Theor. Comput. Sci., 2016)

Decidability, complexity, and expressiveness of first-order logic over the subword ordering. - Simon Halfon; Philippe Schnoebelen; Georg Zetzsche (LICS, 2017)

Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk). - Philippe Schnoebelen (MFCS, 2017)

The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. - Jean Goubault-Larrecq; Simon Halfon; Prateek Karandikar; K. Narayan Kumar; Philippe Schnoebelen (CoRR, 2019)

On shuffle products, acyclic automata and piecewise-testable languages. - Simon Halfon; Philippe Schnoebelen (Inf. Process. Lett., 2019)

The height of piecewise-testable languages and the complexity of the logic of subwords. - Prateek Karandikar; Philippe Schnoebelen (Log. Methods Comput. Sci., 2019)

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. - Jérôme Leroux; M. Praveen; Philippe Schnoebelen; Grégoire Sutre (Log. Methods Comput. Sci., 2019)

On Flat Lossy Channel Machines. - Philippe Schnoebelen (CSL, 2021)

On Arch Factorization and Subword Universality for Words and Compressed Words. - Philippe Schnoebelen; Julien Veron (WORDS, 2023)

Measuring well quasi-ordered finitary powersets. - Sergio Abriola; Simon Halfon; Aliaume Lopez; Sylvain Schmitz; Philippe Schnoebelen; Isa Vialard (CoRR, 2023)

On the Piecewise Complexity of Words and Periodic Words. - M. Praveen; Philippe Schnoebelen; Julien Veron; Isa Vialard (SOFSEM, 2024)

A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed Words. - Philippe Schnoebelen; Julien Veron; Isa Vialard (ICALP, 2025)

On the piecewise complexity of words. - Philippe Schnoebelen; Isa Vialard (Acta Informatica, 2025)