9th International Workshop on
Expressiveness in Concurrency
August 19, 2002
Brno University, Czech Republic
Affiliated with CONCUR 2002, 20 - 23 August 2002.
Invited speakers:
Catuscia Palamidessi
(Penn State University, USA)
Igor Walukiewicz
(Warsaw University, Poland)
[ Home | Call for Papers | Accepted Papers | Programme | Online Publication ]
Last modified: Sat Jun 29 18:54:57 CEST 2002

Accepted Papers

Out of 30 (!) submissions,
the following 9 papers were accepted by the programme committee.

Martin Lange
Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition

Nicolas Markey
Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past

Maribel Fernandez, Lionel Khalil
Interaction Nets with McCarthy's amb

Rance Cleaveland, Gerald Lüttgen
A Logical Process Calculus

Daniele Beauquier, Yoram Hirshfeld, Alexander Rabinovich, Anatol Slissenko
The Probability Nesting Game

Vladimiro Sassone, Pawel Sobocinski
Deriving Bisimulation Congruences: A 2-categorical Approach

Ulrik Frendrup, Hans Hüttel, Jesper Nyholm Jensen
Modal Logics for Cryptographic Processes

Marco Carbone, Sergio Maffeis
On the Expressive Power of Polyadic Synchronisation in pi-calculus

Joel Ouaknine, James Worrell
Timed CSP = Closed Timed Safety Automata

e-mail to the webadmin of this site