BibSLEIGH — Philippe

Travelled to:

1 × Croatia
1 × Cyprus
1 × Czech Republic
1 × Hungary
1 × Poland
1 × The Netherlands
1 × USA
2 × Canada
2 × Denmark
2 × France
2 × Germany
2 × Italy
2 × Switzerland

Collaborated with:

P.Chambart F.Laroussinie S.Schmitz N.Bertrand ∅ N.Markey C.Dufourd D.Lugiez P.Karandikar S.Haddad B.Bérard A.Labroue P.Jancar A.Finkel D.Figueira S.Figueira

Talks about:

net (5) problem (4) recurs (4) model (4) check (4) regular (3) complex (3) logic (3) embed (3) decid (3)

Person: Philippe Schnoebelen

DBLP: Schnoebelen:Philippe

Contributed to:

2013

2012

2011

2010

2008

2003

2002

2001

2000

1999

1998

1988

2016

Wrote 21 papers:

QAPL-2013-BertrandS #automaton #game studies #infinity #probability: Solving Stochastic Büchi Games on Infinite Decisive Arenas (NB, PS), pp. 116–131.
LICS-2012-HaddadSS #complexity #petri net #recursion: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (SH, SS, PS), pp. 355–364.
ICALP-v2-2011-SchmitzS #bound #multi #recursion: Multiply-Recursive Upper Bounds with Higman’s Lemma (SS, PS), pp. 441–452.
LICS-2011-FigueiraFSS #bound #recursion: Ackermannian and Primitive-Recursive Bounds with Dickson’s Lemma (DF, SF, SS, PS), pp. 269–278.
DLT-2010-ChambartS #problem #set: Computing Blocker Sets for the Regular Post Embedding Problem (PC, PS), pp. 136–147.
FoSSaCS-2010-ChambartS #composition #towards: Toward a Compositional Theory of Leftist Grammars and Transformations (PC, PS), pp. 237–251.
ICALP-v2-2010-ChambartS #problem: Pumping and Counting on the Regular Post Embedding Problem (PC, PS), pp. 64–75.
FoSSaCS-2008-ChambartS #problem: The ω-Regular Post Embedding Problem (PC, PS), pp. 97–111.
LICS-2008-ChambartS #complexity #recursion: The Ordinal Recursive Complexity of Lossy Channel Systems (PC, PS), pp. 205–216.
FoSSaCS-2003-BertrandS #decidability #model checking: Model Checking Lossy Channels Systems Is Probably Decidable (NB, PS), pp. 120–135.
ICALP-2003-Schnoebelen #model checking: Oracle Circuits for Branching-Time Model Checking (PS), pp. 790–801.
FoSSaCS-2002-LaroussinieMS #model checking #on the: On Model Checking Durational Kripke Structures (FL, NM, PS), pp. 264–279.
LICS-2002-LaroussinieMS #logic: Temporal Logic with Forgettable Past (FL, NM, PS), pp. 383–392.
FoSSaCS-2001-LaroussinieMS #model checking: Model Checking CTL+ and FCTL is Hard (FL, NM, PS), pp. 318–331.
FoSSaCS-2000-BerardLS #equivalence #parallel #performance #process #verification: Verifying Performance Equivalence for Timed Basic Parallel Processes (BB, AL, PS), pp. 35–47.
FoSSaCS-2000-LaroussinieS #bisimulation #equivalence #explosion #problem: The State Explosion Problem from Trace to Bisimulation Equivalence (FL, PS), pp. 192–207.
ICALP-2000-LugiezS #decidability #first-order #logic: Decidable First-Order Transition Logics for PA-Processes (DL, PS), pp. 342–353.
ICALP-1999-DufordJS #bound: Boundedness of Reset P/T Nets (CD, PJ, PS), pp. 301–310.
ICALP-1998-DufourdFS #decidability: Reset Nets Between Decidability and Undecidability (CD, AF, PS), pp. 103–115.
ALP-1988-Schnoebelen #compilation #functional #pattern matching: Refined Compilation of Pattern-Matching for Functional Languages (PS), pp. 233–243.
CSL-2016-KarandikarS #complexity #logic: The Height of Piecewise-Testable Languages with Applications in Logical Complexity (PK, PS), p. 22.