The following pages link to Philippe Schnoebelen (Q1045896):
Displaying 50 items.
- (Q197795) (redirect page) (← links)
- (Q236076) (redirect page) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- A note on the attractor-property of infinite-state Markov chains (Q1045897) (← links)
- Mu-calculus path checking (Q1045942) (← links)
- A rewrite-based type discipline for a subset of computer algebra (Q1176783) (← links)
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Generalized Post embedding problems (Q2354596) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- On the index of Simon's congruence for piecewise testability (Q2512830) (← links)
- Verification of probabilistic systems with faulty communication (Q2573634) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- (Q2754156) (← links)
- (Q2766577) (← links)
- (Q2771058) (← links)
- The Power of Well-Structured Systems (Q2842095) (← links)
- (Q2852063) (← links)
- Unidirectional Channel Systems Can Be Tested (Q2915167) (← links)
- The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (Q2986811) (← links)
- On Solving Temporal Logic Queries (Q2996133) (← links)
- (Q3150206) (← links)
- On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders (Q3295145) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- On Functions Weakly Computable by Petri Nets and Vector Addition Systems (Q3447705) (← links)
- Mixing Lossy and Perfect Fifo Channels (Q3541029) (← links)
- Toward a Compositional Theory of Leftist Grammars and Transformations (Q3557855) (← links)
- Computing Blocker Sets for the Regular Post Embedding Problem (Q3584888) (← links)
- Lossy Counter Machines Decidability Cheat Sheet (Q3584961) (← links)
- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets (Q3586117) (← links)
- Pumping and Counting on the Regular Post Embedding Problem (Q3587427) (← links)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness (Q3613069) (← links)
- (Q4219024) (← links)
- (Q4222919) (← links)
- (Q4251913) (← links)
- (Q4381382) (← links)
- (Q4417855) (← links)
- (Q4449220) (← links)
- (Q4508291) (← links)
- (Q4508303) (← links)
- (Q4511269) (← links)
- (Q4736876) (← links)
- (Q4738231) (← links)
- On Termination for Faulty Channel Machines (Q4910713) (← links)
- An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems (Q4917080) (← links)
- (Q4938633) (← links)
- (Q4992528) (← links)
