14. CONCUR 2003: Marseille, France

• Albert Benveniste, Stefan Haar, Eric Fabre, Claude Jard:
  Distributed Monitoring of Concurrent and Asynchronous Systems. 1-26
  
• Alin Stefanescu, Javier Esparza, Anca Muscholl:
  Synthesis of Distributed Algorithms Using Asynchronous Automata. 27-41
  
• Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis:
  Compression of Partially Ordered Strings. 42-56
  
• Rob J. van Glabbeek, Frits W. Vaandrager:
  Bundle Event Structures and CCSP. 57-71
  
• Bartek Klin, Pawel Sobocinski:
  Syntactic Formats for Free. 72-86
  
• Irek Ulidowski:
  Priority Rewrite Systems for OSOS Process Languages. 87-101
  
• Luca de Alfaro:
  Quantitative Verification and Control via the Mu-Calculus. 102-126
  
• Rajeev Alur, Salvatore La Torre, P. Madhusudan:
  Playing Games with Boxes and Diamonds. 127-141
  
• Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga:
  The Element of Surprise in Timed Games. 142-156
  
• Petr Jancar, Antonín Kucera, Faron Moller:
  Deciding Bisimilarity between BPA and BPP Processes. 157-171
  
• Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar:
  Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management. 172-187
  
• Nancy A. Lynch:
  Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, ... 187-188
  
• Eugene W. Stark, Rance Cleaveland, Scott A. Smolka:
  A Process-Algebraic Language for Probabilistic I/O Automata. 189-203
  
• Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
  Compositionality for Probabilistic Automata. 204-222
  
• Paul Gastin, Dietrich Kuske:
  Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. 218-232
  
• Zdenek Sawa:
  Equivalence Checking of Non-Flat Systems Is EXPTIME-hard. 233-248
  
• Nicolas Markey, Ph. Schnoebelen:
  Model Checking a Path. 248-262
  
• Arie Gurfinkel, Marsha Chechik:
  Multi-Valued Model Checking via Classical Model Checking. 263-277
  
• Naoya Nitta, Hiroyuki Seki:
  An Extension of Pushdown System and Its Model Checking Method. 278-292
  
• Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan:
  Netcharts: Bridging the gap between HMSCs and executable specifications. 293-307
  
• Blaise Genest, Loïc Hélouët, Anca Muscholl:
  High-Level Message Sequence Charts and Projections. 308-322
  
• Paulo Mateus, John C. Mitchell, Andre Scedrov:
  Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus. 323-345
  
• Michael Backes:
  Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions. 346-360
  
• Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov:
  Contract Signing, Optimism, and Advantage. 361-377
  
• Mikkel Nygaard, Glynn Winskel:
  Full Abstraction for HOPLA. 378-392
  
• Uwe Nestmann, Rachele Fuzzati, Massimo Merro:
  Modeling Consensus in a Process Calculus. 393-407
  
• Philippa Gardner, Cosimo Laneve, Lucian Wischik:
  Linear Forwarders. 408-422
  
• Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler:
  Abstract Patterns of Compositional Reasoning. 423-438
  
• Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
  Relating Fairness and Timing in Process Algebras. 438-452
  
• Barry Norton, Gerald Lüttgen, Michael Mendler:
  A Compositional Semantic Theory for Synchronous Component-based Design. 453-467
  
• Vincent Danos, Josee Desharnais, Prakash Panangaden:
  Conditional Expectation and the Approximation of Labelled Markov Processes. 468-482
  
• Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf:
  Comparative Branching-Time Semantics. 482-497
  
• Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
  Quantitative Relations and Approximate Process Equivalences. 498-512