Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Schnoebelen, Philippe"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cutting through regular post embedding problems
Prateek Karandikar
,
Philippe Schnoebelen
Lecture Notes in Computer Science
7353
, 2012, pp. 229-240
Pumping and counting on the regular post embedding problem
Pierre Chambart
,
Philippe Schnoebelen
Lecture Notes in Computer Science
6199
, 2010, pp. 64-75
Revisiting Ackermann-hardness for lossy counter machines and Reset Petri nets
Philippe Schnoebelen
Lecture Notes in Computer Science
6281
, 2010, pp. 616-628
Post embedding problem is not primitive recursive, with applications to channel systems
Pierre Chambart
,
Philippe Schnoebelen
Lecture Notes in Computer Science
4855
, 2007, pp. 265-276
A note on the attractor-property of infinite-state Markov chains
Christel Baier
,
Nathalie Bertrand
,
Philippe Schnoebelen
Information Processing Letters
97
(2), 2006, pp. 58-63
A general approach to comparing infinite-state systems with their finite-state specifications
Antonín Kuc̑era
,
Philippe Schnoebelen
Theoretical Computer Science
358
(2-3), 2006, pp. 315-333
\mu
-calculus path checking
Nicolas Markey
,
Philippe Schnoebelen
Information Processing Letters
97
(6), 2006, pp. 225-230
BTL
_2
and the expressive power of ECTL
^+
Alexander Rabinovich
,
Philippe Schnoebelen
Information and Computation
204
(7), 2006, pp. 1023-1044
Decidable first-order transition logics for
PA
-processes
Denis Lugiez
,
Philippe Schnoebelen
Information and Computation
203
(1), 2005, pp. 75-113
Oracle circuits for branching-time model checking
Philippe Schnoebelen
Lecture Notes in Computer Science
2719
, 2003, pp. 790-801
The complexity of propositional linear temporal logics in simple cases
Stéphane Demri
,
Philippe Schnoebelen
Information and Computation
174
(1), 2002, pp. 84-103
Decidable first-order transition logics for
PA
-processes
Denis Lugiez
,
Philippe Schnoebelen
Lecture Notes in Computer Science
1853
, 2000, pp. 342-353
Bisimulation and the reduction of Petri nets
Philippe Schnoebelen
,
Natalia Sidorova
Lecture Notes in Computer Science
1825
, 2000, pp. 409-423
Fundamental structures in well-structured infinite transition systems
Alain Finkel
,
Philippe Schnoebelen
Lecture Notes in Computer Science
1380
, 1998, pp. 102-118