Philippe Schnoebelen - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Philippe Schnoebelen' as author, editor, or advisor:

Decidability, complexity, and expressiveness of first-order logic over the subword orderingSimon Halfon, Philippe Schnoebelen, Georg Zetzsche. lics 2017: 1-12 [doi]
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched NetsSerge Haddad, Sylvain Schmitz, Philippe Schnoebelen. lics 2012: 355-364 [doi]
On Arch Factorization and Subword Universality for Words and Compressed WordsPhilippe Schnoebelen, Julien Veron. cwords 2023: 274-287 [doi]
Generalized Post Embedding ProblemsPrateek Karandikar, Philippe Schnoebelen. mst, 56(4):697-716, 2015. [doi]
Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003, Marseille, France, September 2, 2003Philippe Schnoebelen, editor, Volume 98 of Electronic Notes in Theoretical Computer Science, Elsevier, 2004. [doi]
On termination and invariance for faulty channel machinesPatricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell. fac, 24(4-6):595-607, 2012. [doi]
Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)Philippe Schnoebelen. mfcs 2017: [doi]
Unidirectional Channel Systems Can Be TestedPetr Jancar, Prateek Karandikar, Philippe Schnoebelen. ifipTCS 2012: 149-163 [doi]
Cutting through Regular Post Embedding ProblemsPrateek Karandikar, Philippe Schnoebelen. csr 2012: 229-240 [doi]
On the State Complexity of Closures and Interiors of Regular Languages with SubwordsPrateek Karandikar, Philippe Schnoebelen. dcfs 2014: 234-245 [doi]
Pumping and Counting on the Regular Post Embedding ProblemPierre Chambart, Philippe Schnoebelen. icalp 2010: 64-75 [doi]
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri NetsPhilippe Schnoebelen. mfcs 2010: 616-628 [doi]
The Height of Piecewise-Testable Languages with Applications in Logical ComplexityPrateek Karandikar, Philippe Schnoebelen. csl 2016: [doi]
On shuffle products, acyclic automata and piecewise-testable languagesSimon Halfon, Philippe Schnoebelen. ipl, 145:68-73, 2019. [doi]
Computable fixpoints in well-structured symbolic model checkingNathalie Bertrand, Philippe Schnoebelen. fmsd, 43(2):233-267, 2013. [doi]
Computing Blocker Sets for the Regular Post Embedding ProblemPierre Chambart, Philippe Schnoebelen. dlt 2010: 136-147 [doi]
Lossy Counter Machines Decidability Cheat SheetPhilippe Schnoebelen. rp 2010: 51-75 [doi]
The Power of Priority Channel SystemsChristoph Haase, Sylvain Schmitz, Philippe Schnoebelen. concur 2013: 319-333 [doi]
On the Piecewise Complexity of Words and Periodic WordsM. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard. sofsem 2024: 456-470 [doi]
On the state complexity of closures and interiors of regular languages with subwords and superwordsPrateek Karandikar, Matthias Niewerth, Philippe Schnoebelen. TCS, 610:91-107, 2016. [doi]
On Flat Lossy Channel MachinesPhilippe Schnoebelen. csl 2021: [doi]
Ackermannian and Primitive-Recursive Bounds with Dickson s LemmaDiego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen. lics 2011: 269-278 [doi]
Towards the automatic verification of PLC programs written in Instruction ListGéraud Canet, Sandrine Couffin, Jean-Jacques Lesage, Antoine Petit, Philippe Schnoebelen. SMC 2000: 2449-2454 [doi]
The Power of Well-Structured SystemsSylvain Schmitz, Philippe Schnoebelen. concur 2013: 5-24 [doi]
Decidability in the Logic of Subsequences and SupersequencesPrateek Karandikar, Philippe Schnoebelen. fsttcs 2015: 84-97 [doi]
The height of piecewise-testable languages and the complexity of the logic of subwordsPrateek Karandikar, Philippe Schnoebelen. lmcs, 15(2), 2019. [doi]
On Functions Weakly Computable by Pushdown Petri Nets and Related SystemsJérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre. lmcs, 15(4), 2019. [doi]
Systems and Software VerificationBerard, B., Bidoit, M., Finkel, A., Laroussinie, F., Petit, A., Petrucci, L., Schnoebelen, P.. Springer, 2001.
/tau-Bisimulations and Full Abstraction for Refinement of ActionsFerroudja Cherief, Ph. Schnoebelen. ipl, 40(4):219-222, 1991.
Temporal Logic with Forgettable PastFrançois Laroussinie, Nicolas Markey, Ph. Schnoebelen. lics 2002: 383-392 [doi]
A General Approach to Comparing Infinite-State Systems with Their Finite-State SpecificationsAntonín Kucera, Ph. Schnoebelen. concur 2004: 371-386 [doi]
Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003Ph. Schnoebelen. ENTCS, 98:1, 2004. [doi]
Oracle Circuits for Branching-Time Model CheckingPh. Schnoebelen. icalp 2003: 790-801 [doi]
A Formal Framework for the Analysis of Recursive-Parallel ProgramsOlga Kouchnarenko, Ph. Schnoebelen. pact 1997: 45-59
A parametric analysis of the state-explosion problem in model checkingStéphane Demri, François Laroussinie, Ph. Schnoebelen. jcss, 72(4):547-575, 2006. [doi]
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel SystemsPierre Chambart, Ph. Schnoebelen. fsttcs 2007: 265-276 [doi]
On Functions Weakly Computable by Petri Nets and Vector Addition SystemsJ. LeRoux, Ph. Schnoebelen. rp 2014: 190-202 [doi]
BTL::2:: and the expressive power of ECTL:::+:::Alexander Rabinovich, Ph. Schnoebelen. iandc, 204(7):1023-1044, 2006. [doi]
TSMV: A Symbolic Model Checker for Quantitative Analysis of SystemsNicolas Markey, Ph. Schnoebelen. qest 2004: 330-331 [doi]
Model Checking Lossy Channels Systems Is Probably DecidableNathalie Bertrand, Ph. Schnoebelen. fossacs 2003: 120-135 [doi]
Translation Results for Modal Logics of Reactive SystemsFrançois Laroussinie, Sophie Pinchinat, Ph. Schnoebelen. amast 1994: 297-306
Mixing Lossy and Perfect Fifo ChannelsPierre Chambart, Ph. Schnoebelen. concur 2008: 340-355 [doi]
A general approach to comparing infinite-state systems with their finite-state specificationsAntonín Kucera, Ph. Schnoebelen. TCS, 358(2-3):315-333, 2006. [doi]
Mu-calculus path checkingNicolas Markey, Ph. Schnoebelen. ipl, 97(6):225-230, 2006. [doi]
Strong Bisimilarity on Nets RevisitedC. Autant, Z. Belmesk, Ph. Schnoebelen. parle 1991: 295-312
The omega-Regular Post Embedding ProblemPierre Chambart, Ph. Schnoebelen. fossacs 2008: 97-111 [doi]
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time propertiesChristel Baier, Nathalie Bertrand, Ph. Schnoebelen. tocl, 9(1):5, 2007. [doi]
Model Checking CTL:::+::: and FCTL is HardFrançois Laroussinie, Nicolas Markey, Ph. Schnoebelen. fossacs 2001: 318-331 [doi]
Reset Nets Between Decidability and UndecidabilityCatherine Dufourd, Alain Finkel, Ph. Schnoebelen. icalp 1998: 103-115 [doi]
The Verification of Probabilistic Lossy Channel SystemsPh. Schnoebelen. voss 2004: 445-466 [doi]
Well-structured transition systems everywhere!Alain Finkel, Ph. Schnoebelen. TCS, 256(1-2):63-92, 2001. [doi]
The State Explosion Problem from Trace to Bisimulation EquivalenceFrançois Laroussinie, Ph. Schnoebelen. fossacs 2000: 192-207 [doi]
Some Decidability Results for Nested Petri NetsIrina A. Lomazova, Ph. Schnoebelen. ershov 2000: 208-220 [doi]
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and FairnessChristel Baier, Nathalie Bertrand, Ph. Schnoebelen. forte 2006: 212-227 [doi]
Specification in CTL+Past for Verification in CTLFrançois Laroussinie, Ph. Schnoebelen. iandc, 156(1-2):236-263, 2000.
Efficient timed model checking for discrete-time systemsFrançois Laroussinie, Nicolas Markey, Ph. Schnoebelen. TCS, 353(1-3):249-271, 2006. [doi]
On the expressivity and complexity of quantitative branching-time temporal logicsFrançois Laroussinie, Ph. Schnoebelen, Mathieu Turuani. TCS, 297(1-3):297-315, 2003. [doi]
Decidable First-Order Transition Logics for PA-ProcessesDenis Lugiez, Ph. Schnoebelen. icalp 2000: 342-353 [doi]
On Verifying Fair Lossy Channel SystemsBenoît Masson, Ph. Schnoebelen. mfcs 2002: 543-555 [doi]
Bisimulation and the Reduction of Petri NetsPh. Schnoebelen, Natalia Sidorova. apn 2000: 409-423 [doi]
Bisimulation and Other Undecidable Equivalences for Lossy Channel SystemsPh. Schnoebelen. tacs 2001: 385-399 [doi]
A PTIME-complete matching problem for SLP-compressed wordsNicolas Markey, Ph. Schnoebelen. ipl, 90(1):3-6, 2004. [doi]
A model for recursive-parallel programsOlga Kouchnarenko, Ph. Schnoebelen. ENTCS, 5:30, 1996. [doi]
A Hierarchy of Temporal Logics with PastFrançois Laroussinie, Ph. Schnoebelen. TCS, 148(2):303-324, 1995. [doi]
Verifying lossy channel systems has nonprimitive recursive complexityPh. Schnoebelen. ipl, 83(5):251-261, 2002. [doi]
Symbolic Model Checking for Simply-Timed SystemsNicolas Markey, Ph. Schnoebelen. formats 2004: 102-117 [doi]
The Ordinal Recursive Complexity of Lossy Channel SystemsPierre Chambart, Ph. Schnoebelen. lics 2008: 205-216 [doi]
On Solving Temporal Logic QueriesSamuel Hornus, Ph. Schnoebelen. amast 2002: 163-177 [doi]
Verifying Performance Equivalence for Timed Basic Parallel ProcessesBéatrice Bérard, Anne Labroue, Ph. Schnoebelen. fossacs 2000: 35-47 [doi]
The regular viewpoint on PA-processesDenis Lugiez, Ph. Schnoebelen. TCS, 274(1-2):89-115, 2002. [doi]
Specification in CTL+Past, verification in CTLFrançois Laroussinie, Ph. Schnoebelen. ENTCS, 7:161-184, 1997. [doi]
The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract)Stéphane Demri, Ph. Schnoebelen. STACS 1998: 61-72
Boundedness of Reset P/T NetsCatherine Dufourd, Petr Jancar, Ph. Schnoebelen. icalp 1999: 301-310 [doi]
An Automata-Theoretic Approach to the Reachability Analysis of RPPS SystemsAnne Labroue, Ph. Schnoebelen. ENTCS, 52(1):1-20, 2001. [doi]
Experiments on Processes with BacktrackingPh. Schnoebelen. concur 1991: 480-494
Model Checking Timed Automata with One or Two ClocksFrançois Laroussinie, Nicolas Markey, Ph. Schnoebelen. concur 2004: 387-401 [doi]
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel SystemsChristel Baier, Nathalie Bertrand, Ph. Schnoebelen. lpar 2006: 347-361 [doi]
A note on the attractor-property of infinite-state Markov chainsChristel Baier, Nathalie Bertrand, Ph. Schnoebelen. ipl, 97(2):58-63, 2006. [doi]
Rewriting Techniques for the Temporal Analysis of Communicating ProcessesPh. Schnoebelen. parle 1987: 402-419
A Parametric Analysis of the State Explosion Problem in Model CheckingStéphane Demri, François Laroussinie, Ph. Schnoebelen. STACS 2002: 620-631 [doi]
Model Checking Branching Time LogicsPh. Schnoebelen. time 2007: 5 [doi]
Translations Between Modal Logics of Reactive SystemsFrançois Laroussinie, Sophie Pinchinat, Ph. Schnoebelen. TCS, 140(1):53-71, 1995. [doi]
Verification of probabilistic systems with faulty communicationParosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Ph. Schnoebelen. iandc, 202(2):141-165, 2005. [doi]
On Model Checking Durational Kripke StructuresFrançois Laroussinie, Nicolas Markey, Ph. Schnoebelen. fossacs 2002: 264-279 [doi]
An Automata-Theoretic Approach to the Reachability Analysis of RPPS SystemsAnne Labroue, Ph. Schnoebelen. njc, 9(1):118-144, 2002.
On the Expressivity and Complexity of Quantitative Branching-Time Temporal LogicsFrançois Laroussinie, Ph. Schnoebelen, Mathieu Turuani. latin 2000: 437-446
The Regular Viewpoint on PA-ProcessesDenis Lugiez, Ph. Schnoebelen. concur 1998: 50-66 [doi]
Flat Acceleration in Symbolic Model CheckingSébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen. ATVA 2005: 474-488 [doi]
Decidable first-order transition logics for PA-processesDenis Lugiez, Ph. Schnoebelen. iandc, 203(1):75-113, 2005. [doi]
The Complexity of Temporal Logic Model CheckingPh. Schnoebelen. aiml 2003: 393-436
A Short Visit to the STS HierarchyNathalie Bertrand, Ph. Schnoebelen. ENTCS, 154(3):59-69, 2006. [doi]
On Termination for Faulty Channel MachinesPatricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell. STACS 2008: 121-132 [doi]
A Rewrite-Based Type Discipline for a Subset of Computer AlgebraHubert Comon, Denis Lugiez, Ph. Schnoebelen. JSC, 11(4):349-368, 1991.
The Complexity of Propositional Linear Temporal Logics in Simple CasesStéphane Demri, Ph. Schnoebelen. iandc, 174(1):84-103, 2002. [doi]
On the Weak Adequacy of Branching-Time Remporal LogicPh. Schnoebelen, Sophie Pinchinat. ESOP 1990: 377-388
Fundamental Structures in Well-Structured Infinite Transition SystemsAlain Finkel, Ph. Schnoebelen. latin 1998: 102-118 [doi]
Model Checking a PathNicolas Markey, Ph. Schnoebelen. concur 2003: 248-262 [doi]
A Hierarchy of Temporal Logics with Past (Extended Abstract)François Laroussinie, Ph. Schnoebelen. STACS 1994: 47-58
Toward a Compositional Theory of Leftist Grammars and TransformationsPierre Chambart, Ph. Schnoebelen. fossacs 2010: 237-251 [doi]
Specification of a Pipelined Event Driven Simulator using FP2Peter Schäfer, Ph. Schnoebelen. parle 1987: 311-328
Place Bisimulations in Petri NetsC. Autant, Ph. Schnoebelen. apn 1992: 45-61
Multiply-Recursive Upper Bounds with Higman s LemmaSylvain Schmitz, Ph. Schnoebelen. icalp 2011: 441-452 [doi]

All Publications

Filter by Year

Filter by Type

Filter by Topic

Filter by Venue

Filter by Co-author

Filter by Top terms

Download

External Links

Profile Name

Statistics

Aliases

Researchr

Philippe Schnoebelen's Profile

Unidentified Publications