@article{Halpern-Shore/04,
AUTHOR = {Halpern, Joseph Y. and Shore, Richard A.},
TITLE = {Reasoning about common knowledge with infinitely many agents},
JOURNAL = {Inf.~Comput.},
VOLUME = {191},
NUMBER = {1},
PAGES = {1-40},
YEAR = {2004},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1016/j.ic.2004.01.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Compagnoni/04,
AUTHOR = {Compagnoni, Adriana},
TITLE = {Higher-order subtyping and its decidability},
JOURNAL = {Inf.~Comput.},
VOLUME = {191},
NUMBER = {1},
PAGES = {41-103},
YEAR = {2004},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {higher-order lambda calculus, higher-order subtyping, intersection types, bounded polymorphism, decidability},
URL = {http://dx.doi.org/10.1016/j.ic.2004.01.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Luttgen-Vogler/04,
AUTHOR = {L{\"u}ttgen, Gerald and Vogler, Walter},
TITLE = {Bisimulation on speed: Worst-case efficiency},
JOURNAL = {Inf.~Comput.},
VOLUME = {191},
NUMBER = {2},
PAGES = {105-144},
YEAR = {2004},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {asynchronous systems, process algebra, worst-case timing behavior, faster-than relation, bisimulation},
URL = {http://dx.doi.org/10.1016/j.ic.2002.08.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Yoshida-Berger-Honda/04,
AUTHOR = {Yoshida, Nobuko and Berger, Martin and Honda, Kohei},
TITLE = {Strong normalisation in the $\pi$-calculus},
JOURNAL = {Inf.~Comput.},
VOLUME = {191},
NUMBER = {2},
PAGES = {145-202},
YEAR = {2004},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {concurrency theory, the $\pi$-calculus, strong normalisation, type theory},
URL = {http://dx.doi.org/10.1016/j.ic.2003.08.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Aceto-Fokkink-van_Glabbeek-Ingolfsdottir/04,
AUTHOR = {Aceto, Luca and Fokkink, Wan and van Glabbeek, Rob and Ing{\'o}lfsd{\'o}ttir, Anna},
TITLE = {Nested semantics over finite trees are equationally hard},
JOURNAL = {Inf.~Comput.},
VOLUME = {191},
NUMBER = {2},
PAGES = {203-232},
YEAR = {2004},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {concurrency, process algebra, bccsp, nested simulation, possible futures, nested trace semantics, equational logic, complete axiomatizations, non-finitely based algebras, hennessy-milner logic},
URL = {http://dx.doi.org/10.1016/j.ic.2004.02.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}