Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456

Address: [go: Go Back, main page]
Remove Scripts Accept Cookies Show Images Show Referer Rotate13 Base64 Strip Meta Strip Title Session Cookies

Concurrency Theory Presence in Spring Conferences 2004

16 December 2003

I have recently looked at the lists of accepted papers for STACS 2004 and FOSSACS 2004, hoping to see a good concurrency theory presence in those conferences.

Let's begin with the bad news. One concurrency theorist's look at the list of papers accepted for presentation at STACS 2004 is somewhat depressing. The only accepted paper I found of possible direct interest to me is "Automata-based Analysis of Recursive Cryptographic Protocols" by Ralf Kuesters and Thomas Wilke. I am also curious to browse through the paper "Algebraic Results on Quantum Automata" by Mark Mercer, Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts and Denis Therien, but I stand little chance of understanding its significance --- letting alone its technicalities.

Fortunately, the list of accepted papers for FOSSACS 2004 should bring back a smile to the average member of the concurrency theory community. That conference will feature a host of papers whose titles and/or sets of authors triggered my imagination, namely

Finite Alphabets versus omega-Completeness: From Ready Pairs to Ready Traces

Sumit Nain and Wan Fokkink

Hypergraphs and degrees of parallelism: a completeness result

Antonio Bucciarelli and Benjamin Leperchey

Bisimulation on Speed: Lower Time Bounds

Walter Vogler and Gerald Lüttgen

Decidability of Freshness, Undecidability of Revelation

Giovanni Conforti and Giorgio Ghelli

LTL over Integer Periodicity Constraints (extended abstract)

Stephane Demri

Strong Bisimulation for the Explicit Fusion Calculus

Lucian Wischik

Duality for Labelled Markov Processes

James Worrell

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting

Ehrig Hartmut and Barbara Koenig

Angelic Semantics of Fine-Grained Concurrency

Dan R. Ghica and Andrzej Murawski

Behavioral and Spatial Observations in a Logic for the Pi-Calculus

Luis Caires

On the existence of an effective and complete inference system for cryptographic protocols

iana Bozga, Cristian Ene and Yassine Lakhnech

SAFEDPI: a language for controlling mobile code

Matthew Hennessy, Julian Rathke and Nobuko Yoshida

A Note on the Perfect Encryption Assumption in a Process Calculus

Pierpaolo Degano and Roberto Zunino

On Recognizable Timed Languages

Maler Oded and Amir Pnueli

Electoral Systems in Ambient Calculi

Iain Phillips

On the Expressiveness of CCS-like Calculi

Pablo Giambiagi, Gerardo Schneider and D. Frank Valencia

Specifying and Verifying Partial Order Properties using Template MSCs

Blaise Genest, Marius Minea, Anca Muscholl and Doron Peled

Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols

John Mitchell, Ajith Ramanathan, Andre Scedrov and Vanessa Teague

I will try to locate these papers on the web soon, and will try to read and report on some of them in this diary. In addition, intellectual curiousity, as well as the author of that work, demands that I also try to look at the paper "Partial correctness assertions provable in dynamic logics" by Daniel Leivant.

It is good to see our field so well represented in FOSSACS 2004. I hope that papers on many aspects of process theory will also be submitted to ICALP 2004 (deadline: February 8, 2004) and LICS 2004 (deadline: January 26, 2004 (titles and short abstracts) and February 2, 2004 (extended abstracts)) in Turku. Even though I expect little of yours truly, I hope that my colleagues will have excellent papers spreading the work of the process theory community in those most prestigious venues.