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=Inf.~Comput. AND Volume=156
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bisimilarity in term graph rewriting
Zena M. Ariola
,
Jan Willem Klop
,
Detlef Plump
Information and Computation
156
(1-2), 2000, pp. 2-24
Contracts, games, and refinement
Ralph-Johan Back
,
Joakim von Wright
Information and Computation
156
(1-2), 2000, pp. 25-45
Zero-safe nets: Comparing the collective and individual token approaches
Roberto Bruni
,
Ugo Montanari
Information and Computation
156
(1-2), 2000, pp. 46-89
On the expressiveness of Linda coordination primitives
Nadia Busi
,
Roberto Gorrieri
,
Gianluigi Zavattaro
Information and Computation
156
(1-2), 2000, pp. 90-121
Absolute versus relative time in process algebras
Flavio Corradini
Information and Computation
156
(1-2), 2000, pp. 122-172
Tile formats for located and mobile systems
GianLuigi Ferrari
,
Ugo Montanari
Information and Computation
156
(1-2), 2000, pp. 173-235
Specification in CTL+Past for verification in CTL
F. Laroussinie
,
Ph. Schnoebelen
Information and Computation
156
(1-2), 2000, pp. 236-263
Process rewrite systems
Richard Mayr
Information and Computation
156
(1-2), 2000, pp. 264-286
What is a ''good'' encoding of guarded choice?
Uwe Nestmann
Information and Computation
156
(1-2), 2000, pp. 287-319
Expressive completeness of duration calculus
Alexander Rabinovich
Information and Computation
156
(1-2), 2000, pp. 320-344
Bisimilarity of open terms
Arend Rensink
Information and Computation
156
(1-2), 2000, pp. 345-385