Philippe Schnoebelen

From MaRDI portal
Person:1045896

Available identifiers

zbMath Open schnoebelen.philippeMaRDI QIDQ1045896

List of research outcomes

PublicationDate of PublicationType
On Arch Factorization and Subword Universality for Words and Compressed Words2023-07-25Paper
https://portal.mardi4nfdi.de/entity/Q49925282021-06-09Paper
https://portal.mardi4nfdi.de/entity/Q51446882021-01-19Paper
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders2020-07-08Paper
The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings2020-07-08Paper
https://portal.mardi4nfdi.de/entity/Q52070522020-01-03Paper
https://portal.mardi4nfdi.de/entity/Q53766572019-05-17Paper
On shuffle products, acyclic automata and piecewise-testable languages2019-03-11Paper
https://portal.mardi4nfdi.de/entity/Q52784262017-07-19Paper
https://portal.mardi4nfdi.de/entity/Q52783122017-07-13Paper
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties2017-07-12Paper
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets2017-05-16Paper
On the state complexity of closures and interiors of regular languages with subwords and superwords2015-12-10Paper
On Functions Weakly Computable by Petri Nets and Vector Addition Systems2015-10-28Paper
Generalized Post embedding problems2015-07-20Paper
On Reachability for Unidirectional Channel Systems Extended with Regular Tests2015-04-22Paper
On the index of Simon's congruence for piecewise testability2015-01-30Paper
The Power of Priority Channel Systems2015-01-15Paper
On the State Complexity of Closures and Interiors of Regular Languages with Subwords2014-08-07Paper
https://portal.mardi4nfdi.de/entity/Q28520632013-10-07Paper
The Power of Well-Structured Systems2013-08-12Paper
The Power of Priority Channel Systems2013-08-12Paper
An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems2013-04-26Paper
On termination and invariance for faulty channel machines2013-03-22Paper
On Termination for Faulty Channel Machines2013-03-19Paper
Unidirectional Channel Systems Can Be Tested2012-09-21Paper
Generalized Post embedding problems2012-09-10Paper
On Solving Temporal Logic Queries2011-05-06Paper
Pumping and Counting on the Regular Post Embedding Problem2010-09-07Paper
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets2010-09-03Paper
Computing Blocker Sets for the Regular Post Embedding Problem2010-08-31Paper
Lossy Counter Machines Decidability Cheat Sheet2010-08-31Paper
Toward a Compositional Theory of Leftist Grammars and Transformations2010-04-27Paper
CONCUR 2003 - Concurrency Theory2010-03-30Paper
A note on the attractor-property of infinite-state Markov chains2009-12-18Paper
Mu-calculus path checking2009-12-18Paper
Validation of Stochastic Systems2009-07-24Paper
A PTIME-complete matching problem for SLP-compressed words2009-07-21Paper
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness2009-03-11Paper
Mixing Lossy and Perfect Fifo Channels2008-11-25Paper
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems2008-05-27Paper
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems2008-04-24Paper
The ω-Regular Post Embedding Problem2008-04-11Paper
Automated Technology for Verification and Analysis2006-10-10Paper
A general approach to comparing infinite-state systems with their finite-state specifications2006-09-13Paper
\(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)2006-08-16Paper
Decidable first-order transition logics for PA-processes2005-12-07Paper
Verification of probabilistic systems with faulty communication2005-11-22Paper
CONCUR 2004 - Concurrency Theory2005-08-23Paper
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems2005-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47368762004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47382312004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44492202004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q31502062003-10-20Paper
https://portal.mardi4nfdi.de/entity/Q44178552003-07-30Paper
The complexity of propositional linear temporal logics in simple cases2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q27665772002-06-17Paper
The regular viewpoint on PA-processes2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27710582002-02-14Paper
https://portal.mardi4nfdi.de/entity/Q27541562001-11-11Paper
Well-structured transition systems everywhere!2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45082912001-01-17Paper
https://portal.mardi4nfdi.de/entity/Q45112692000-10-30Paper
https://portal.mardi4nfdi.de/entity/Q45083032000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q49386332000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42519131999-09-23Paper
https://portal.mardi4nfdi.de/entity/Q43813821999-08-19Paper
https://portal.mardi4nfdi.de/entity/Q42229191998-12-21Paper
https://portal.mardi4nfdi.de/entity/Q42190241998-11-15Paper
A rewrite-based type discipline for a subset of computer algebra1992-06-25Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Philippe Schnoebelen