| 2002 | Undecidability of Weak Bisimilarity for Pushdown Processes. | Jir Srba |
| 2002 | A Decidable Fixpoint Logic for Time-Outs. | Maria Sorea |
| 2002 | Types, or: Where's the Difference Between CCS and pi? | Davide Sangiorgi |
| 2002 | Expressive Power of Temporal Logics. | Alexander Moshe Rabinovich |
| 2002 | Event-State Duality: The Enriched Case. | Vaughan R. Pratt |
| 2002 | A Deductive Proof System for CTL. | Amir Pnueli, Yonit Kesten |
| 2002 | HOPLA-A Higher-Order Process Language. | Mikkel Nygaard, Glynn Winskel |
| 2002 | Typing and Subtyping Mobility in Boxed Ambients. | Massimo Merro, Vladimiro Sassone |
| 2002 | A Decidable Class of Asynchronous Distributed Controllers. | P. Madhusudan, P. S. Thiagarajan |
| 2002 | Axiomatizing an Algebra of Step Reactions for Synchronous Languages. | Gerald Lttgen, Michael Mendler |
| 2002 | Safe Realizability of High-Level Message Sequence Charts. | Markus Lohrey |
| 2002 | Decidability of Strong Bisimilarity for Timed BPP. | Slawomir Lasota |
| 2002 | Local Model Checking Games for Fixed Point Logic with Chop. | Martin Lange |
| 2002 | On the Decidability of Cryptographic Protocols with Open-Ended Data Structures. | Ralf Ksters |
| 2002 | Why Is Simulation Harder than Bisimulation? | Antonn Kucera, Richard Mayr |
| 2002 | Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}. | Beata Konikowska, Wojciech Penczek |
| 2002 | Causality Semantics of Petri Nets with Weighted Inhibitor Arcs. | H. C. M. Kleijn, Maciej Koutny |
| 2002 | Network Invariants in Action. | Yonit Kesten, Amir Pnueli, Elad Shahar, Lenore D. Zuck |
| 2002 | Types for Cryptographic Protocols. | Andrew D. Gordon |
| 2002 | A Calculus of Mobile Resources. | Jens Chr. Godskesen, Thomas T. Hildebrandt, Vladimiro Sassone |
| 2002 | The Fusion Machine. | Philippa Gardner, Cosimo Laneve, Lucian Wischik |
| 2002 | Refinement and Verification Applied to an In-Flight Data Acquisition Unit. | Wan J. Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein |
| 2002 | Regular Sets of Pomsets with Autoconcurrency. | Jean Fanchon, Rmi Morin |
| 2002 | A Hierarchy of Polynomial-Time Computable Simulations for Automata. | Kousha Etessami |
| 2002 | Weak Bisimulation is Sound and Complete for PCTL*. | Jose Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden |