default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th EXPRESS 2002: Brno, Czech Republic
- Uwe Nestmann, Prakash Panangaden:
9th International Workshop on Expressiveness in Concurrency, EXPRESS 2002, Satellite Workshop from CONCUR 2002, Brno, Czech Republic, August 19, 2002. Electronic Notes in Theoretical Computer Science 68(2), Elsevier 2002 - Uwe Nestmann, Prakash Panangaden:
Preface. 1-2 - Catuscia Palamidessi:
On the Expressive Power of Temporal Concurrent Constraint Programming Languages (invited talk). 3 - Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich
, Anatol Slissenko:
The Probability Nesting Game. 4-14 - Marco Carbone, Sergio Maffeis:
On the Expressive Power of Polyadic Synchronisation in pi-calculus. 15-32 - Rance Cleaveland, Gerald Lüttgen:
A Logical Process Calculus. 33-50 - Maribel Fernández, Lionel Khalil:
Interaction Nets with McCarthy's amb. 51-68 - Igor Walukiewicz:
Describing properties of concurrent systems (Logic for Traces) (invited talk). 69 - Martin Lange:
Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition. 70-86 - Nicolas Markey:
Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past. 87-104 - Vladimiro Sassone, Pawel Sobocinski:
Deriving Bisimulation Congruences: A 2-categorical Approach. 105-123 - Ulrik Frendrup, Hans Hüttel, Jesper Nyholm Jensen:
Modal Logics for Cryptographic Processes. 124-141 - Joël Ouaknine, James Worrell:
Timed CSP = Closed Timed Safety Automata. 142-159
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-08 00:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
