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: Journal=Theor.~Comput.~Sci. AND Volume=274
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A Hoare logic for dynamic networks of asynchronously communicating deterministic processes
F.S. de Boer
Theoretical Computer Science
274
(1-2), 2002, pp. 3-41
Process algebra for performance evaluation
Holger Hermanns
,
Ulrich Herzog
,
Joost-Pieter Katoen
Theoretical Computer Science
274
(1-2), 2002, pp. 43-87
The regular viewpoint on PA-processes
D. Lugiez
,
Ph. Schnoebelen
Theoretical Computer Science
274
(1-2), 2002, pp. 89-115
Branching time controllers for discrete event systems
P. Madhusudan
,
P.S. Thiagarajan
Theoretical Computer Science
274
(1-2), 2002, pp. 117-149
Axioms for real-time logics
P.-Y. Schobbens
,
J.-F. Raskin
,
T.A. Henzinger
Theoretical Computer Science
274
(1-2), 2002, pp. 151-182
From rewrite rules to bisimulation congruences
Peter Sewell
Theoretical Computer Science
274
(1-2), 2002, pp. 183-230
Minimality and separation results on asynchronous mobile processes - representability theorems by concurrent combinators
Nobuko Yoshida
Theoretical Computer Science
274
(1-2), 2002, pp. 231-276