Philippe Schnoebelen

According to our database, Philippe Schnoebelen authored at least 104 papers between 1987 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

On the Piecewise Complexity of Words and Periodic Words.

M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

Measuring well quasi-ordered finitary powersets.

Sergio Abriola, Simon Halfon, Aliaume Lopez, Sylvain Schmitz, Philippe Schnoebelen, Isa Vialard

CoRR, 2023

On Arch Factorization and Subword Universality for Words and Compressed Words.

Philippe Schnoebelen, Julien Veron

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2021

On Flat Lossy Channel Machines.

Philippe Schnoebelen

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

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

The height of piecewise-testable languages and the complexity of the logic of subwords.

Prateek Karandikar, Philippe Schnoebelen

Log. Methods Comput. Sci., 2019

On shuffle products, acyclic automata and piecewise-testable languages.

Simon Halfon, Philippe Schnoebelen

Inf. Process. Lett., 2019

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

2017

Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk).

Philippe Schnoebelen

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Decidability, complexity, and expressiveness of first-order logic over the subword ordering.

Simon Halfon, Philippe Schnoebelen, Georg Zetzsche

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

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

The Height of Piecewise-Testable Languages with Applications in Logical Complexity.

Prateek Karandikar, Philippe Schnoebelen

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

Generalized Post Embedding Problems.

Prateek Karandikar, Philippe Schnoebelen

Theory Comput. Syst., 2015

On the index of Simon's congruence for piecewise testability.

Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen

Inf. Process. Lett., 2015

Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences.

Prateek Karandikar, Philippe Schnoebelen

CoRR, 2015

On Reachability for Unidirectional Channel Systems Extended with Regular Tests.

Petr Jancar, Prateek Karandikar, Philippe Schnoebelen

Log. Methods Comput. Sci., 2015

Decidability in the Logic of Subsequences and Supersequences.

Prateek Karandikar, Philippe Schnoebelen

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

The Power of Priority Channel Systems

Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen

Log. Methods Comput. Sci., 2014

On Functions Weakly Computable by Petri Nets and Vector Addition Systems.

Jérôme Leroux, Philippe Schnoebelen

Proceedings of the Reachability Problems - 8th International Workshop, 2014

On the State Complexity of Closures and Interiors of Regular Languages with Subwords.

Prateek Karandikar, Philippe Schnoebelen

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Computable fixpoints in well-structured symbolic model checking.

Nathalie Bertrand, Philippe Schnoebelen

Formal Methods Syst. Des., 2013

Solving Stochastic Büchi Games on Infinite Decisive Arenas.

Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, 2013

On the index of Simon's congruence for piecewise testability.

Prateek Karandikar, Philippe Schnoebelen

CoRR, 2013

The Power of Well-Structured Systems.

Sylvain Schmitz, Philippe Schnoebelen

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012

On termination and invariance for faulty channel machines.

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell

Formal Aspects Comput., 2012

The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets.

Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Unidirectional Channel Systems Can Be Tested.

Petr Jancar, Prateek Karandikar, Philippe Schnoebelen

Proceedings of the Theoretical Computer Science, 2012

Cutting through Regular Post Embedding Problems.

Prateek Karandikar, Philippe Schnoebelen

Proceedings of the Computer Science - Theory and Applications, 2012

2011

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.

Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Multiply-Recursive Upper Bounds with Higman's Lemma.

Sylvain Schmitz, Philippe Schnoebelen

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma

Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen

CoRR, 2010

Lossy Counter Machines Decidability Cheat Sheet.

Philippe Schnoebelen

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

Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets.

Philippe Schnoebelen

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Pumping and Counting on the Regular Post Embedding Problem.

Pierre Chambart, Philippe Schnoebelen

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Toward a Compositional Theory of Leftist Grammars and Transformations.

Pierre Chambart, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computational Structures, 2010

Computing Blocker Sets for the Regular Post Embedding Problem.

Pierre Chambart, Philippe Schnoebelen

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2008

On Termination for Faulty Channel Machines.

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell

Proceedings of the STACS 2008, 2008

The Ordinal Recursive Complexity of Lossy Channel Systems.

Pierre Chambart, Philippe Schnoebelen

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

The omega-Regular Post Embedding Problem.

Pierre Chambart, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Mixing Lossy and Perfect Fifo Channels.

Pierre Chambart, Philippe Schnoebelen

Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007

Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties.

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

ACM Trans. Comput. Log., 2007

Model Checking Branching Time Logics.

Philippe Schnoebelen

Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), 2007

Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems.

Pierre Chambart, Philippe Schnoebelen

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Efficient timed model checking for discrete-time systems.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Theor. Comput. Sci., 2006

A general approach to comparing infinite-state systems with their finite-state specifications.

Antonín Kucera, Philippe Schnoebelen

Theor. Comput. Sci., 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

Mu-calculus path checking.

Nicolas Markey, Philippe Schnoebelen

Inf. Process. Lett., 2006

A note on the attractor-property of infinite-state Markov chains.

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

Inf. Process. Lett., 2006

BTL₂ and the expressive power of ECTL⁺.

Alexander Rabinovich, Philippe Schnoebelen

Inf. Comput., 2006

On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems.

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the Logic for Programming, 2006

Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness.

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2006

2005

Decidable first-order transition logics for PA-processes.

Denis Lugiez, Philippe Schnoebelen

Inf. Comput., 2005

Verification of probabilistic systems with faulty communication.

Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen

Inf. Comput., 2005

A Short Visit to the STS Hierarchy.

Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the 12th Workshop on Expressiveness on Concurrency, 2005

Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

CoRR, 2005

Flat Acceleration in Symbolic Model Checking.

Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen

Proceedings of the Automated Technology for Verification and Analysis, 2005

2004

A PTIME-complete matching problem for SLP-compressed words.

Nicolas Markey, Philippe Schnoebelen

Inf. Process. Lett., 2004

The Verification of Probabilistic Lossy Channel Systems.

Philippe Schnoebelen

Proceedings of the Validation of Stochastic Systems - A Guide to Current Research, 2004

TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems.

Nicolas Markey, Philippe Schnoebelen

Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

Symbolic Model Checking for Simply-Timed Systems.

Nicolas Markey, Philippe Schnoebelen

Proceedings of the Formal Techniques, 2004

Model Checking Timed Automata with One or Two Clocks.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003

On the expressivity and complexity of quantitative branching-time temporal logics.

François Laroussinie, Philippe Schnoebelen, Mathieu Turuani

Theor. Comput. Sci., 2003

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

Philippe Schnoebelen

Proceedings of INFINITY 2003, 2003

Oracle Circuits for Branching-Time Model Checking.

Philippe Schnoebelen

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Model Checking Lossy Channels Systems Is Probably Decidable.

Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computational Structures, 2003

Model Checking a Path.

Nicolas Markey, Philippe Schnoebelen

Proceedings of the CONCUR 2003, 2003

2002

The regular viewpoint on PA-processes.

Denis Lugiez, Philippe Schnoebelen

Theor. Comput. Sci., 2002

Verifying lossy channel systems has nonprimitive recursive complexity.

Philippe Schnoebelen

Inf. Process. Lett., 2002

The Complexity of Propositional Linear Temporal Logics in Simple Cases.

Stéphane Demri, Philippe Schnoebelen

Inf. Comput., 2002

On Verifying Fair Lossy Channel Systems.

Benoît Masson, Philippe Schnoebelen

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Temporal Logic with Forgettable Past.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

On Model Checking Durational Kripke Structures.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computation Structures, 2002

On Solving Temporal Logic Queries.

Samuel Hornus, Philippe Schnoebelen

Proceedings of the Algebraic Methodology and Software Technology, 2002

The Complexity of Temporal Logic Model Checking.

Philippe Schnoebelen

Proceedings of the Advances in Modal Logic 4, papers from the fourth conference on "Advances in Modal logic," held in Toulouse, France, 30 September, 2002

2001

Well-structured transition systems everywhere!

Alain Finkel, Philippe Schnoebelen

Theor. Comput. Sci., 2001

An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems.

Anne Labroue, Philippe Schnoebelen

Proceedings of the 8th International Workshop on Expressiveness in Concurrency, 2001

Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems.

Philippe Schnoebelen

Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

Model Checking CTL⁺ and FCTL is Hard.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computation Structures, 2001

Systems and Software Verification, Model-Checking Techniques and Tools.

Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie

Springer, ISBN: 9783540415237, 2001

2000

Towards the automatic verification of PLC programs written in Instruction List.

Géraud Canet, Sandrine Couffin, Jean-Jacques Lesage, Antoine Petit, Philippe Schnoebelen

Proceedings of the IEEE International Conference on Systems, 2000

The State Explosion Problem from Trace to Bisimulation Equivalence.

François Laroussinie, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computation Structures, 2000

Verifying Performance Equivalence for Timed Basic Parallel Processes.

Béatrice Bérard, Anne Labroue, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computation Structures, 2000

Bisimulation and the Reduction of Petri Nets.

Philippe Schnoebelen, Natalia Sidorova

Proceedings of the Application and Theory of Petri Nets 2000, 2000

1999

Boundedness of Reset P/T Nets.

Catherine Dufourd, Petr Jancar, Philippe Schnoebelen

Proceedings of the Automata, 1999

Some Decidability Results for Nested Petri Nets.

Irina A. Lomazova, Philippe Schnoebelen

Proceedings of the Perspectives of System Informatics, 1999

1998

The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract).

Stéphane Demri, Philippe Schnoebelen

Proceedings of the STACS 98, 1998

Fundamental Structures in Well-Structured Infinite Transition Systems.

Alain Finkel, Philippe Schnoebelen

Proceedings of the LATIN '98: Theoretical Informatics, 1998

Reset Nets Between Decidability and Undecidability.

Catherine Dufourd, Alain Finkel, Philippe Schnoebelen

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Specification in CTL+Past, verification in CTL.

François Laroussinie, Philippe Schnoebelen

Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

A Formal Framework for the Analysis of Recursive-Parallel Programs.

Olga Kouchnarenko, Philippe Schnoebelen

Proceedings of the Parallel Computing Technologies, 1997

1996

A model for recursive-parallel programs.

Olga Kouchnarenko, Philippe Schnoebelen

Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996

1995

A Hierarchy of Temporal Logics with Past.

François Laroussinie, Philippe Schnoebelen

Theor. Comput. Sci., 1995

Translations Between Modal Logics of Reactive Systems.

François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen

Theor. Comput. Sci., 1995

1994

A Hierarchy of Temporal Logics with Past (Extended Abstract).

François Laroussinie, Philippe Schnoebelen

Proceedings of the STACS 94, 1994

1993

Translation Results for Modal Logics of Reactive Systems.

François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen

Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1992

Place Bisimulations in Petri Nets.

Cyril Autant, Philippe Schnoebelen

Proceedings of the Application and Theory of Petri Nets 1992, 1992

1991

A Rewrite-Based Type Discipline for a Subset of Computer Algebra.

Hubert Comon, Denis Lugiez, Philippe Schnoebelen

J. Symb. Comput., 1991

τ-Bisimulations and Full Abstraction for Refinement of Actions.

Ferroudja Cherief, Philippe Schnoebelen

Inf. Process. Lett., 1991

Strong Bisimilarity on Nets Revisited.

Cyril Autant, Z. Belmesk, Philippe Schnoebelen

Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Experiments on Processes with Backtracking.

Philippe Schnoebelen

Proceedings of the CONCUR '91, 1991

1990

On the Weak Adequacy of Branching-Time Remporal Logic.

Philippe Schnoebelen, Sophie Pinchinat

Proceedings of the ESOP'90, 1990

1988

Refined Compilation of Pattern-Matching for Functional Languages.

Philippe Schnoebelen

Sci. Comput. Program., 1988

1987

Rewriting Techniques for the Temporal Analysis of Communicating Processes.

Philippe Schnoebelen

Proceedings of the PARLE, 1987

Specification of a Pipelined Event Driven Simulator using FP2.

Peter Schäfer, Philippe Schnoebelen

Proceedings of the PARLE, 1987