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
Hilfe
Suche: Author="Schnoebelen, Ph."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multiply-recursive upper bounds with Higman's lemma
S. Schmitz
,
Ph. Schnoebelen
Lecture Notes in Computer Science
6756
, 2011, pp. 441-452
A parametric analysis of the state-explosion problem in model checking
S. Demri
,
F. Laroussinie
,
Ph. Schnoebelen
Journal of Computer and System Sciences
72
(4), 2006, pp. 547-575
Efficient timed model checking for discrete-time systems
F. Laroussinie
,
N. Markey
,
Ph. Schnoebelen
Theoretical Computer Science
353
(1-3), 2006, pp. 249-271
Verification of probabilistic systems with faulty communication
P.A. Abdulla
,
N. Bertrand
,
A. Rabinovich
,
Ph. Schnoebelen
Information and Computation
202
(2), 2005, pp. 141-165
A PTIME-complete matching problem for SLP-compressed words
N. Markey
,
Ph. Schnoebelen
Information Processing Letters
90
(1), 2004, pp. 3-6
On the expressivity and complexity of quantitative branching-time temporal logics
F. Laroussinie
,
Ph. Schnoebelen
,
M. Turuani
Theoretical Computer Science
297
(1-3), 2003, pp. 297-315
The regular viewpoint on PA-processes
D. Lugiez
,
Ph. Schnoebelen
Theoretical Computer Science
274
(1-2), 2002, pp. 89-115
On verifying fair lossy channel systems
Benoît Masson
,
Ph. Schnoebelen
Lecture Notes in Computer Science
2420
, 2002, pp. 543-555
Verifying lossy channel systems has nonprimitive recursive complexity
Ph. Schnoebelen
Information Processing Letters
83
(5), 2002, pp. 251-261
Well-structured transition systems everywhere!
A. Finkel
,
Ph. Schnoebelen
Theoretical Computer Science
256
(1-2), 2001, pp. 63-92
Specification in CTL+Past for verification in CTL
F. Laroussinie
,
Ph. Schnoebelen
Information and Computation
156
(1-2), 2000, pp. 236-263
Boundedness of reset P/T nets
C. Dufourd
,
P. Janc̑ar
,
Ph. Schnoebelen
Lecture Notes in Computer Science
1644
, 1999, pp. 301-310
The complexity of propositional linear temporal logics in simple cases
S. Demri
,
Ph. Schnoebelen
Lecture Notes in Computer Science
1373
, 1998, pp. 61-72
Reset nets between decidability and undecidability
C. Dufourd
,
A. Finkel
,
Ph. Schnoebelen
Lecture Notes in Computer Science
1443
, 1998, pp. 103-115
The regular viewpoint on PA-processes
D. Lugiez
,
Ph. Schnoebelen
Proceedings of the 3rd International Workshop on Verification of Infinite State Systems, INFINITY'98 (Aalborg, Denmark, July 18, 1998)
, 1998, pp. 27-43
Translations betweeen modal logics of reactive systems
F. Laroussinie
,
S. Pinchinat
,
Ph. Schnoebelen
Theoretical Computer Science
140
(1), 1995, pp. 53-71
A hierarchy of temporal logics with past
F. Laroussinie
,
Ph. Schnoebelen
Theoretical Computer Science
148
(2), 1995, pp. 303-324
A hierarchy of temporal logics with past
F. Laroussinie
,
Ph. Schnoebelen
Lecture Notes in Computer Science
775
, 1994, pp. 47-58
Place bisimulations in Petri nets
C. Autant
,
Ph. Schnoebelen
Lecture Notes in Computer Science
616
, 1992, pp. 45-61
Strong bisimilarity on nets revisited
C. Autant
,
Z. Belmesk
,
Ph. Schnoebelen
Lecture Notes in Computer Science
506
, 1991, pp. 295-312
\tau
-bisimulations and full abstraction for refinement of actions
F. Cherief
,
Ph. Schnoebelen
Information Processing Letters
40
, 1991, pp. 219-222
A rewrite-based type discipline for a subset of computer algebra
H. Comon
,
D. Lugiez
,
Ph. Schnoebelen
Journal Symbolic Computation
11
(4), 1991, pp. 349-368