Philippe Schnoebelen

131 papers A* 10A 5B 28C 3Misc 1Journal 54Unranked 28
YearRankTypeTitle / Venue / Authors
2025 A* conf
A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed Words.
ICALP
Philippe Schnoebelen, Julien Veron, Isa Vialard
2025 J jnl
On the piecewise complexity of words.
Acta Informatica
Philippe Schnoebelen, Isa Vialard
2024 B conf
On the Piecewise Complexity of Words and Periodic Words.
SOFSEM
M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard
2024 J jnl
On the piecewise complexity of words.
CoRR
Philippe Schnoebelen, Isa Vialard
2023 J jnl
Measuring well quasi-ordered finitary powersets.
CoRR
Sergio Abriola, Simon Halfon, Aliaume Lopez, Sylvain Schmitz, Philippe Schnoebelen, Isa Vialard
2023 — conf
On Arch Factorization and Subword Universality for Words and Compressed Words.
WORDS
Philippe Schnoebelen, Julien Veron
2023 J jnl
On arch factorization and subword universality for words and compressed words.
CoRR
Philippe Schnoebelen, Julien Veron
2023 J jnl
On the piecewise complexity of words and periodic words.
CoRR
M. Praveen, Philippe Schnoebelen, Isa Vialard, Julien Veron
2021 B conf
On Flat Lossy Channel Machines.
CSL
Philippe Schnoebelen
2020 J jnl
On flat lossy channel machines.
CoRR
Philippe Schnoebelen
2019 J jnl
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems.
CoRR
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
2019 J jnl
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems.
Log. Methods Comput. Sci.
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
2019 J jnl
On shuffle products, acyclic automata and piecewise-testable languages.
Inf. Process. Lett.
Simon Halfon, Philippe Schnoebelen
2019 J jnl
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering.
CoRR
Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen
2019 J jnl
The height of piecewise-testable languages and the complexity of the logic of subwords.
Log. Methods Comput. Sci.
Prateek Karandikar, Philippe Schnoebelen
2018 J jnl
On shuffle products, acyclic automata and piecewise-testable languages.
CoRR
Simon Halfon, Philippe Schnoebelen
2017 J jnl
Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering.
CoRR
Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
2017 A* conf
Decidability, complexity, and expressiveness of first-order logic over the subword ordering.
LICS
Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
2017 B conf
Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk).
MFCS
Philippe Schnoebelen
2016 J jnl
On the state complexity of closures and interiors of regular languages with subwords and superwords.
Theor. Comput. Sci.
Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen
2016 B conf
The Height of Piecewise-Testable Languages with Applications in Logical Complexity.
CSL
Prateek Karandikar, Philippe Schnoebelen
2015 — conf
Decidability in the Logic of Subsequences and Supersequences.
FSTTCS
Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
Decidability in the logic of subsequences and supersequences.
CoRR
Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
Generalized Post Embedding Problems.
Theory Comput. Syst.
Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences.
CoRR
Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
On Reachability for Unidirectional Channel Systems Extended with Regular Tests.
Log. Methods Comput. Sci.
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
On the index of Simon's congruence for piecewise testability.
Inf. Process. Lett.
Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen
2014 — conf
On Functions Weakly Computable by Petri Nets and Vector Addition Systems.
RP
Jérôme Leroux, Philippe Schnoebelen
2014 — conf
On the State Complexity of Closures and Interiors of Regular Languages with Subwords.
DCFS
Prateek Karandikar, Philippe Schnoebelen
2014 J jnl
On the state complexity of closures and interiors of regular languages with subwords.
CoRR
Prateek Karandikar, Philippe Schnoebelen
2014 J jnl
The Power of Priority Channel Systems
Log. Methods Comput. Sci.
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
2014 J jnl
The Power of Well-Structured Systems.
CoRR
Sylvain Schmitz, Philippe Schnoebelen
2013 J jnl
Computable fixpoints in well-structured symbolic model checking.
Formal Methods Syst. Des.
Nathalie Bertrand, Philippe Schnoebelen
2013 J jnl
On the index of Simon's congruence for piecewise testability.
CoRR
Prateek Karandikar, Philippe Schnoebelen
2013 — conf
Solving Stochastic Büchi Games on Infinite Decisive Arenas.
QAPL
Nathalie Bertrand, Philippe Schnoebelen
2013 B conf
The Power of Priority Channel Systems.
CONCUR
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
2013 B conf
The Power of Well-Structured Systems.
CONCUR
Sylvain Schmitz, Philippe Schnoebelen
2012 Misc conf
Cutting through Regular Post Embedding Problems.
CSR
Prateek Karandikar, Philippe Schnoebelen
2012 J jnl
On termination and invariance for faulty channel machines.
Formal Aspects Comput.
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell
2012 A* conf
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets.
LICS
Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen
2012 — conf
Unidirectional Channel Systems Can Be Tested.
IFIP TCS
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
2011 A* conf
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.
LICS
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
2011 J jnl
Cutting Through Regular Post Embedding Problems
CoRR
Prateek Karandikar, Philippe Schnoebelen
2011 J jnl
Multiply-Recursive Upper Bounds with Higman's Lemma
CoRR
Sylvain Schmitz, Philippe Schnoebelen
2011 — conf
Multiply-Recursive Upper Bounds with Higman's Lemma.
ICALP (2)
Sylvain Schmitz, Philippe Schnoebelen
2010 J jnl
Ackermann and Primitive-Recursive Bounds with Dickson's Lemma
CoRR
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
2010 C conf
Computing Blocker Sets for the Regular Post Embedding Problem.
Developments in Language Theory
Pierre Chambart, Philippe Schnoebelen
2010 — conf
Lossy Counter Machines Decidability Cheat Sheet.
RP
Philippe Schnoebelen
2010 — conf
Pumping and Counting on the Regular Post Embedding Problem.
ICALP (2)
Pierre Chambart, Philippe Schnoebelen
2010 B conf
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets.
MFCS
Philippe Schnoebelen
2010 J jnl
Toward a Compositional Theory of Leftist Grammars and Transformations
CoRR
Pierre Chambart, Philippe Schnoebelen
2010 B conf
Toward a Compositional Theory of Leftist Grammars and Transformations.
FoSSaCS
Pierre Chambart, Philippe Schnoebelen
2008 B conf
Mixing Lossy and Perfect Fifo Channels.
CONCUR
Pierre Chambart, Philippe Schnoebelen
2008 J jnl
On Termination for Faulty Channel Machines
CoRR
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell
2008 A conf
On Termination for Faulty Channel Machines.
STACS
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell
2008 A* conf
The Ordinal Recursive Complexity of Lossy Channel Systems.
LICS
Pierre Chambart, Philippe Schnoebelen
2008 B conf
The omega-Regular Post Embedding Problem.
FoSSaCS
Pierre Chambart, Philippe Schnoebelen
2007 C conf
Model Checking Branching Time Logics.
TIME
Philippe Schnoebelen
2007 — conf
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems.
FSTTCS
Pierre Chambart, Philippe Schnoebelen
2007 J jnl
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties.
ACM Trans. Comput. Log.
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
2006 J jnl
A general approach to comparing infinite-state systems with their finite-state specifications.
Theor. Comput. Sci.
Antonín Kucera, Philippe Schnoebelen
2006 J jnl
A note on the attractor-property of infinite-state Markov chains.
Inf. Process. Lett.
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
2006 J jnl
A parametric analysis of the state-explosion problem in model checking.
J. Comput. Syst. Sci.
Stéphane Demri, François Laroussinie, Philippe Schnoebelen
2006 J jnl
BTL
Inf. Comput.
Alexander Rabinovich, Philippe Schnoebelen
2006 J jnl
Efficient timed model checking for discrete-time systems.
Theor. Comput. Sci.
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
2006 J jnl
Mu-calculus path checking.
Inf. Process. Lett.
Nicolas Markey, Philippe Schnoebelen
2006 B conf
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems.
LPAR
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
2006 J jnl
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems
CoRR
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
2006 C conf
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness.
FORTE
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
2005 — conf
A Short Visit to the STS Hierarchy.
EXPRESS
Nathalie Bertrand, Philippe Schnoebelen
2005 J jnl
Decidable first-order transition logics for PA-processes.
Inf. Comput.
Denis Lugiez, Philippe Schnoebelen
2005 B conf
Flat Acceleration in Symbolic Model Checking.
ATVA
Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen
2005 J jnl
Verification of probabilistic systems with faulty communication.
Inf. Comput.
Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen
2005 J jnl
Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties
CoRR
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
2004 B conf
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications.
CONCUR
Antonín Kucera, Philippe Schnoebelen
2004 J jnl
A PTIME-complete matching problem for SLP-compressed words.
Inf. Process. Lett.
Nicolas Markey, Philippe Schnoebelen
2004 B conf
Model Checking Timed Automata with One or Two Clocks.
CONCUR
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
2004 — ed.
Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003, Marseille, France, September 2, 2003
INFINITY
Philippe Schnoebelen
2004 — conf
Symbolic Model Checking for Simply-Timed Systems.
FORMATS/FTRTFT
Nicolas Markey, Philippe Schnoebelen
2004 — conf
TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems.
QEST
Nicolas Markey, Philippe Schnoebelen
2004 — conf
The Verification of Probabilistic Lossy Channel Systems.
Validation of Stochastic Systems
Philippe Schnoebelen
2003 B conf
Model Checking Lossy Channels Systems Is Probably Decidable.
FoSSaCS
Nathalie Bertrand, Philippe Schnoebelen
2003 B conf
Model Checking a Path.
CONCUR
Nicolas Markey, Philippe Schnoebelen
2003 J jnl
On the expressivity and complexity of quantitative branching-time temporal logics.
Theor. Comput. Sci.
François Laroussinie, Philippe Schnoebelen, Mathieu Turuani
2003 A* conf
Oracle Circuits for Branching-Time Model Checking.
ICALP
Philippe Schnoebelen
2003 — conf
Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003.
INFINITY
Philippe Schnoebelen
2002 A conf
A Parametric Analysis of the State Explosion Problem in Model Checking.
STACS
Stéphane Demri, François Laroussinie, Philippe Schnoebelen
2002 J jnl
An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems.
Nord. J. Comput.
Anne Labroue, Philippe Schnoebelen
2002 B conf
On Model Checking Durational Kripke Structures.
FoSSaCS
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
2002 — conf
On Solving Temporal Logic Queries.
AMAST
Samuel Hornus, Philippe Schnoebelen
2002 B conf
On Verifying Fair Lossy Channel Systems.
MFCS
Benoît Masson, Philippe Schnoebelen
2002 A* conf
Temporal Logic with Forgettable Past.
LICS
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
2002 J jnl
The Complexity of Propositional Linear Temporal Logics in Simple Cases.
Inf. Comput.
Stéphane Demri, Philippe Schnoebelen
2002 B conf
The Complexity of Temporal Logic Model Checking.
Advances in Modal Logic
Philippe Schnoebelen
2002 J jnl
The regular viewpoint on PA-processes.
Theor. Comput. Sci.
Denis Lugiez, Philippe Schnoebelen
2002 J jnl
Verifying lossy channel systems has nonprimitive recursive complexity.
Inf. Process. Lett.
Philippe Schnoebelen
2001 — conf
An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems.
EXPRESS
Anne Labroue, Philippe Schnoebelen
2001 — conf
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems.
TACS
Philippe Schnoebelen
2001 B conf
Model Checking CTL
FoSSaCS
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
2001 — book
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
2001 J jnl
Well-structured transition systems everywhere!
Theor. Comput. Sci.
Alain Finkel, Philippe Schnoebelen
2000 — conf
Bisimulation and the Reduction of Petri Nets.
ICATPN
Philippe Schnoebelen, Natalia Sidorova
2000 A* conf
Decidable First-Order Transition Logics for PA-Processes.
ICALP
Denis Lugiez, Philippe Schnoebelen
2000 B conf
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics.
LATIN
François Laroussinie, Philippe Schnoebelen, Mathieu Turuani
2000 J jnl
Specification in CTL+Past for Verification in CTL.
Inf. Comput.
François Laroussinie, Philippe Schnoebelen
2000 B conf
The State Explosion Problem from Trace to Bisimulation Equivalence.
FoSSaCS
François Laroussinie, Philippe Schnoebelen
2000 B conf
Towards the automatic verification of PLC programs written in Instruction List.
SMC
Géraud Canet, Sandrine Couffin, Jean-Jacques Lesage, Antoine Petit, Philippe Schnoebelen
2000 B conf
Verifying Performance Equivalence for Timed Basic Parallel Processes.
FoSSaCS
Béatrice Bérard, Anne Labroue, Philippe Schnoebelen
1999 A* conf
Boundedness of Reset P/T Nets.
ICALP
Catherine Dufourd, Petr Jancar, Philippe Schnoebelen
1999 — conf
Some Decidability Results for Nested Petri Nets.
Ershov Memorial Conference
Irina A. Lomazova, Philippe Schnoebelen
1998 B conf
Fundamental Structures in Well-Structured Infinite Transition Systems.
LATIN
Alain Finkel, Philippe Schnoebelen
1998 A* conf
Reset Nets Between Decidability and Undecidability.
ICALP
Catherine Dufourd, Alain Finkel, Philippe Schnoebelen
1998 A conf
The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract).
STACS
Stéphane Demri, Philippe Schnoebelen
1998 B conf
The Regular Viewpoint on PA-Processes.
CONCUR
Denis Lugiez, Philippe Schnoebelen
1997 B conf
A Formal Framework for the Analysis of Recursive-Parallel Programs.
PaCT
Olga Kouchnarenko, Philippe Schnoebelen
1997 — conf
Specification in CTL+Past, verification in CTL.
EXPRESS
François Laroussinie, Philippe Schnoebelen
1996 — conf
A model for recursive-parallel programs.
INFINITY
Olga Kouchnarenko, Philippe Schnoebelen
1995 J jnl
A Hierarchy of Temporal Logics with Past.
Theor. Comput. Sci.
François Laroussinie, Philippe Schnoebelen
1995 J jnl
Translations Between Modal Logics of Reactive Systems.
Theor. Comput. Sci.
François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen
1994 A conf
A Hierarchy of Temporal Logics with Past (Extended Abstract).
STACS
François Laroussinie, Philippe Schnoebelen
1993 — conf
Translation Results for Modal Logics of Reactive Systems.
AMAST
François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen
1992 — conf
Place Bisimulations in Petri Nets.
Application and Theory of Petri Nets
Cyril Autant, Philippe Schnoebelen
1991 J jnl
A Rewrite-Based Type Discipline for a Subset of Computer Algebra.
J. Symb. Comput.
Hubert Comon, Denis Lugiez, Philippe Schnoebelen
1991 B conf
Experiments on Processes with Backtracking.
CONCUR
Philippe Schnoebelen
1991 — conf
Strong Bisimilarity on Nets Revisited.
PARLE (2)
Cyril Autant, Z. Belmesk, Philippe Schnoebelen
1991 J jnl
τ-Bisimulations and Full Abstraction for Refinement of Actions.
Inf. Process. Lett.
Ferroudja Cherief, Philippe Schnoebelen
1990 A conf
On the Weak Adequacy of Branching-Time Remporal Logic.
ESOP
Philippe Schnoebelen, Sophie Pinchinat
1988 — conf
Refined Compilation of Pattern-Matching for Functional Languages.
ALP
Philippe Schnoebelen
1988 J jnl
Refined Compilation of Pattern-Matching for Functional Languages.
Sci. Comput. Program.
Philippe Schnoebelen
1987 — conf
Rewriting Techniques for the Temporal Analysis of Communicating Processes.
PARLE (2)
Philippe Schnoebelen
1987 — conf
Specification of a Pipelined Event Driven Simulator using FP2.
PARLE (1)
Peter Schaefer, Philippe Schnoebelen