Philippe Schnoebelen

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 18

Top Venues

CoRR

Log. Methods Comput. Sci.

Inf. Process. Lett.

CSL

Publications

M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard
On the Piecewise Complexity of Words and Periodic Words. SOFSEM (2024)
M. Praveen, Philippe Schnoebelen, Isa Vialard, Julien Veron
On the piecewise complexity of words and periodic words. CoRR (2023)
Philippe Schnoebelen, Julien Veron
On arch factorization and subword universality for words and compressed words. CoRR (2023)
Philippe Schnoebelen, Julien Veron
On Arch Factorization and Subword Universality for Words and Compressed Words. WORDS (2023)
Sergio Abriola, Simon Halfon, Aliaume Lopez, Sylvain Schmitz, Philippe Schnoebelen, Isa Vialard
Measuring well quasi-ordered finitary powersets. CoRR (2023)
Philippe Schnoebelen
On Flat Lossy Channel Machines. CSL (2021)
Philippe Schnoebelen
On flat lossy channel machines. CoRR (2020)
Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. CoRR (2019)
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Log. Methods Comput. Sci. 15 (4) (2019)
Simon Halfon, Philippe Schnoebelen
On shuffle products, acyclic automata and piecewise-testable languages. Inf. Process. Lett. 145 (2019)
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. CoRR (2019)
Prateek Karandikar, Philippe Schnoebelen
The height of piecewise-testable languages and the complexity of the logic of subwords. Log. Methods Comput. Sci. 15 (2) (2019)
Simon Halfon, Philippe Schnoebelen
On shuffle products, acyclic automata and piecewise-testable languages. CoRR (2018)
Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
Decidability, complexity, and expressiveness of first-order logic over the subword ordering. LICS (2017)
Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering. CoRR (2017)
Philippe Schnoebelen
Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk). MFCS (2017)
Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen
On the state complexity of closures and interiors of regular languages with subwords and superwords. Theor. Comput. Sci. 610 (2016)
Prateek Karandikar, Philippe Schnoebelen
The Height of Piecewise-Testable Languages with Applications in Logical Complexity. CSL (2016)
Prateek Karandikar, Philippe Schnoebelen
Generalized Post Embedding Problems. Theory Comput. Syst. 56 (4) (2015)
Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen
On the index of Simon's congruence for piecewise testability. Inf. Process. Lett. 115 (4) (2015)
Prateek Karandikar, Philippe Schnoebelen
Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences. CoRR (2015)
Prateek Karandikar, Philippe Schnoebelen
Decidability in the Logic of Subsequences and Supersequences. FSTTCS (2015)
Prateek Karandikar, Philippe Schnoebelen
Decidability in the logic of subsequences and supersequences. CoRR (2015)
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
On Reachability for Unidirectional Channel Systems Extended with Regular Tests. Log. Methods Comput. Sci. 11 (2) (2015)
Prateek Karandikar, Philippe Schnoebelen
On the state complexity of closures and interiors of regular languages with subwords. CoRR (2014)
Jérôme Leroux, Philippe Schnoebelen
On Functions Weakly Computable by Petri Nets and Vector Addition Systems. RP (2014)
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
The Power of Priority Channel Systems Log. Methods Comput. Sci. 10 (4) (2014)
Sylvain Schmitz, Philippe Schnoebelen
The Power of Well-Structured Systems. CoRR (2014)
Prateek Karandikar, Philippe Schnoebelen
On the State Complexity of Closures and Interiors of Regular Languages with Subwords. DCFS (2014)
Sylvain Schmitz, Philippe Schnoebelen
The Power of Well-Structured Systems. CONCUR (2013)
Prateek Karandikar, Philippe Schnoebelen
On the index of Simon's congruence for piecewise testability. CoRR (2013)
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
The Power of Priority Channel Systems. CONCUR (2013)
Nathalie Bertrand, Philippe Schnoebelen
Computable fixpoints in well-structured symbolic model checking. Formal Methods Syst. Des. 43 (2) (2013)
Nathalie Bertrand, Philippe Schnoebelen
Solving Stochastic Büchi Games on Infinite Decisive Arenas. QAPL (2013)
Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. LICS (2012)
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
Unidirectional Channel Systems Can Be Tested. IFIP TCS (2012)
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell
On termination and invariance for faulty channel machines. Formal Aspects Comput. 24 (4-6) (2012)
Prateek Karandikar, Philippe Schnoebelen
Cutting through Regular Post Embedding Problems. CSR (2012)
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. LICS (2011)
Prateek Karandikar, Philippe Schnoebelen
Cutting Through Regular Post Embedding Problems CoRR (2011)
Sylvain Schmitz, Philippe Schnoebelen
Multiply-Recursive Upper Bounds with Higman's Lemma. ICALP (2) (2011)
Sylvain Schmitz, Philippe Schnoebelen
Multiply-Recursive Upper Bounds with Higman's Lemma CoRR (2011)
Pierre Chambart, Philippe Schnoebelen
Toward a Compositional Theory of Leftist Grammars and Transformations. FoSSaCS (2010)
Pierre Chambart, Philippe Schnoebelen
Toward a Compositional Theory of Leftist Grammars and Transformations CoRR (2010)
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
Ackermann and Primitive-Recursive Bounds with Dickson's Lemma CoRR (2010)
Pierre Chambart, Philippe Schnoebelen
Computing Blocker Sets for the Regular Post Embedding Problem. Developments in Language Theory (2010)
Philippe Schnoebelen
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. MFCS (2010)
Pierre Chambart, Philippe Schnoebelen
Pumping and Counting on the Regular Post Embedding Problem. ICALP (2) (2010)
Philippe Schnoebelen
Lossy Counter Machines Decidability Cheat Sheet. RP (2010)
Pierre Chambart, Philippe Schnoebelen
Mixing Lossy and Perfect Fifo Channels. CONCUR (2008)
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell
On Termination for Faulty Channel Machines CoRR (2008)
Pierre Chambart, Philippe Schnoebelen
The omega-Regular Post Embedding Problem. FoSSaCS (2008)
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell
On Termination for Faulty Channel Machines. STACS (2008)
Pierre Chambart, Philippe Schnoebelen
The Ordinal Recursive Complexity of Lossy Channel Systems. LICS (2008)
Philippe Schnoebelen
Model Checking Branching Time Logics. TIME (2007)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Trans. Comput. Log. 9 (1) (2007)
Pierre Chambart, Philippe Schnoebelen
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. FSTTCS (2007)
Stéphane Demri, François Laroussinie, Philippe Schnoebelen
A parametric analysis of the state-explosion problem in model checking. J. Comput. Syst. Sci. 72 (4) (2006)
Alexander Rabinovich, Philippe Schnoebelen
. Inf. Comput. 204 (7) (2006)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. FORTE (2006)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. LPAR (2006)
Antonín Kucera, Philippe Schnoebelen
A general approach to comparing infinite-state systems with their finite-state specifications. Theor. Comput. Sci. 358 (2-3) (2006)
Nicolas Markey, Philippe Schnoebelen
Mu-calculus path checking. Inf. Process. Lett. 97 (6) (2006)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
A note on the attractor-property of infinite-state Markov chains. Inf. Process. Lett. 97 (2) (2006)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems CoRR (2006)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
Efficient timed model checking for discrete-time systems. Theor. Comput. Sci. 353 (1-3) (2006)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties CoRR (2005)
Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen
Flat Acceleration in Symbolic Model Checking. ATVA (2005)
Denis Lugiez, Philippe Schnoebelen
Decidable first-order transition logics for PA-processes. Inf. Comput. 203 (1) (2005)
Nathalie Bertrand, Philippe Schnoebelen
A Short Visit to the STS Hierarchy. EXPRESS (2005)
Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen
Verification of probabilistic systems with faulty communication. Inf. Comput. 202 (2) (2005)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
Model Checking Timed Automata with One or Two Clocks. CONCUR (2004)
Philippe Schnoebelen
The Verification of Probabilistic Lossy Channel Systems. Validation of Stochastic Systems (2004)
Nicolas Markey, Philippe Schnoebelen
TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems. QEST (2004)
Nicolas Markey, Philippe Schnoebelen
A PTIME-complete matching problem for SLP-compressed words. Inf. Process. Lett. 90 (1) (2004)
Antonín Kucera, Philippe Schnoebelen
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. CONCUR (2004)
Nicolas Markey, Philippe Schnoebelen
Symbolic Model Checking for Simply-Timed Systems. FORMATS/FTRTFT (2004)
Philippe Schnoebelen
Oracle Circuits for Branching-Time Model Checking. ICALP (2003)
Nicolas Markey, Philippe Schnoebelen
Model Checking a Path. CONCUR (2003)
Philippe Schnoebelen
Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003. INFINITY (2003)
Nathalie Bertrand, Philippe Schnoebelen
Model Checking Lossy Channels Systems Is Probably Decidable. FoSSaCS (2003)
François Laroussinie, Philippe Schnoebelen, Mathieu Turuani
On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297 (1-3) (2003)
Philippe Schnoebelen
Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83 (5) (2002)
Stéphane Demri, Philippe Schnoebelen
The Complexity of Propositional Linear Temporal Logics in Simple Cases. Inf. Comput. 174 (1) (2002)
Stéphane Demri, François Laroussinie, Philippe Schnoebelen
A Parametric Analysis of the State Explosion Problem in Model Checking. STACS (2002)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
Temporal Logic with Forgettable Past. LICS (2002)
Philippe Schnoebelen
The Complexity of Temporal Logic Model Checking. Advances in Modal Logic (2002)
Benoît Masson, Philippe Schnoebelen
On Verifying Fair Lossy Channel Systems. MFCS (2002)
Anne Labroue, Philippe Schnoebelen
An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. Nord. J. Comput. 9 (1) (2002)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
On Model Checking Durational Kripke Structures. FoSSaCS (2002)
Denis Lugiez, Philippe Schnoebelen
The regular viewpoint on PA-processes. Theor. Comput. Sci. 274 (1-2) (2002)
Samuel Hornus, Philippe Schnoebelen
On Solving Temporal Logic Queries. AMAST (2002)
Anne Labroue, Philippe Schnoebelen
An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. EXPRESS (2001)
Alain Finkel, Philippe Schnoebelen
Well-structured transition systems everywhere! Theor. Comput. Sci. 256 (1-2) (2001)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
and FCTL is Hard. FoSSaCS (2001)
Philippe Schnoebelen
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. TACS (2001)
Denis Lugiez, Philippe Schnoebelen
Decidable First-Order Transition Logics for PA-Processes. ICALP (2000)
François Laroussinie, Philippe Schnoebelen, Mathieu Turuani
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. LATIN (2000)
François Laroussinie, Philippe Schnoebelen
The State Explosion Problem from Trace to Bisimulation Equivalence. FoSSaCS (2000)
François Laroussinie, Philippe Schnoebelen
Specification in CTL+Past for Verification in CTL. Inf. Comput. 156 (1-2) (2000)

Philippe Schnoebelen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Philippe Schnoebelen