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="Hennessy, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bisimulations for a calculus of broadcasting systems
M. Hennessy
,
J. Rathke
Theoretical Computer Science
200
(1-2), 1998, pp. 225-260
Towards a semantic theory of CML
W. Ferreira
,
M. Hennessy
Lecture Notes in Computer Science
969
, 1995, pp. 454-466
Symbolic bisimulations
M. Hennessy
,
H. Lin
Theoretical Computer Science
138
(2), 1995, pp. 353-389
A modal logic for message passing processes
M. Hennessy
,
X. Liu
Acta Informatica
32
, 1995, pp. 375-393
Bisimulations for a calculus of broadcasting systems
M. Hennessy
,
J. Rathke
Lecture Notes in Computer Science
962
, 1995, pp. 486-500
Concurrent testing of processes
M. Hennessy
Acta Informatica
32
, 1995, pp. 509-543
Adding action refinement to a finite process algebra
L. Aceto
,
M. Hennessy
Information and Computation
115
(2), 1994, December, pp. 179-247
A fully abstract denotational model for higher-order processes
M. Hennessy
Information and Computation
112
(1), 1994, July, pp. 55-95
Higher-order processes and their models
M. Hennessy
Lecture Notes in Computer Science
820
, 1994, pp. 286-303
Towards action-refinement in process algebras
L. Aceto
,
M. Hennessy
Information and Computation
103
(2), 1993, April, pp. 204-269
Observing localities
G. Boudol
,
I. Castellani
,
M. Hennessy
,
A. Kiehn
Theoretical Computer Science
114
(1), 1993, pp. 31-61
A theory of communicating processes with value passing
M. Hennessy
,
A. Ingólfsdóttir
Information and Computation
107
(2), 1993, December, pp. 202-236
Termination, deadlock, and divergence
L. Aceto
,
M. Hennessy
Journal of the ACM
39
(1), 1992, January, pp. 147-187
An efficiency preorder for processes
S. Arun-Kumar
,
M. Hennessy
Acta Informatica
29
, 1992, pp. 737-760
Adding action refinement to a finite process algebra
L. Aceto
,
M. Hennessy
Lecture Notes in Computer Science
510
, 1991, pp. 506-519
Observing localities
G. Boudol
,
I. Castellani
,
M. Hennessy
,
A. Kiehn
Lecture Notes in Computer Science
520
, 1991, pp. 93-102
A theory of communicating processes with value-passing
M. Hennessy
,
A. Ingôlfsdóttir
Lecture Notes in Computer Science
443
, 1990, pp. 209-219
Distributed bisimulations
I. Castellani
,
M. Hennessy
Journal of the ACM
36
(4), 1989, October, pp. 887-911
A proof system for communicating processes with value-passing
M. Hennessy
Lecture Notes in Computer Science
405
, 1989, pp. 325-339
An algebraic theory of fair asynchronous communicating processes
M. Hennessy
Theoretical Computer Science
49
(2-3), 1987, pp. 121-143
Algebraic laws for nondeterminism and concurrency
M. Hennessy
,
R. Milner
Journal of the ACM
32
(1), 1985, pp. 137-161
The power of the future perfect in program logics
M. Hennessy
,
C. Stirling
Information and Control
67
(1-3), 1985, pp. 23-52
Acceptance trees
M. Hennessy
Journal of the ACM
32
(4), 1985, pp. 896-928
An algebraic theory of fair asynchronous communicating processes
M. Hennessy
Lecture Notes in Computer Science
194
, 1985, pp. 260-269
The power of the future perfect in program logics
M. Hennessy
,
C. Stirling
Lecture Notes in Computer Science
176
, 1984, pp. 301-311
Seiten 1
2
>