10. CONCUR 1999: Eindhoven, The Netherlands

Invited Lectures

• Rance Cleaveland:
  Temporal Process Logic (Abstract). 1
  
• Javier Esparza, Stefan Römer:
  An Unfolding Algorithm for Synchronous Products of Transition Systems. 2-20
  
• Rob J. van Glabbeek:
  Petri Nets, Configuration Structures and Higher Dimensional Automata. 21-27
  
• Catuscia Palamidessi:
  Expressiveness and Distributed Implementation of Conciurrent Calculi with Link Mobility. 28-29
  

Tutorials

• Petr Jancar, Faron Moller:
  Techniques for Decidability and Undecidability of Bisimilarity. 30-45
  
• Jan Tretmans:
  Testing Concurrent Systems: A Formal Approach. 46-65
  

Accepted Papers

• Luca de Alfaro:
  Computing Minimum and Maximum Reachability Times in Probabilistic Systems. 66-81
  
• Rajeev Alur, Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang:
  Automating Modular Verification. 82-97
  
• Rajeev Alur, Bow-Yaw Wang:
  ``Next'' Heuristic for On-the-Fly Model Checking. 98-113
  
• Rajeev Alur, Mihalis Yannakakis:
  Model Checking of Message Sequence Charts. 114-129
  
• Paul C. Attie:
  Synthesis of Large Concurrent Programs via Pairwise Composition. 130-145
  
• Christel Baier, Joost-Pieter Katoen, Holger Hermanns:
  Approximate Symbolic Model Checking of Continuous-Time Markov Chains. 146-161
  
• Albert Benveniste, Benoît Caillaud, Paul Le Guernic:
  From Synchrony to Asynchrony. 162-177
  
• Béatrice Bérard, Laurent Fribourg:
  Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. 178-193
  
• Eike Best, Alexander Lavrov:
  Weak and Strong Composition of High-Level Petri-Nets. 194-209
  
• Burkhard Bieber, Hans Fleischhack:
  Model Checking of Time Petri Nets Based on Partial Order Semantics. 210-225
  
• Frank S. de Boer, Gianluigi Zavattaro:
  Generic Process Algebras for Asynchronous Communication. 226-241
  
• Hubert Comon, Yan Jurski:
  Timed Automata and the Theory of Real Numbers. 242-257
  
• Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
  Metrics for Labeled Markov Systems. 258-273
  
• Arkadi Estrin, Michael Kaminski:
  The Expressive Power of Temporal Logic of Actions (Extended Abstract). 274-287
  
• Cormac Flanagan, Martín Abadi:
  Object Types against Races. 288-303
  
• Yuxi Fu:
  Open Bisimulations on Chi Processes. 304-319
  
• Thomas A. Henzinger, Benjamin Horowitz, Rupak Majumdar:
  Rectangular Hybrid Games. 320-335
  
• Yuh-Jzer Joung:
  Localizability of Fairness Constraints and Their Distributed Implementations. 336-351
  
• Barbara König:
  Generating Type Systems for Process Graphs. 352-367
  
• Antonín Kucera, Richard Mayr:
  Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. 368-382
  
• Orna Kupferman, Moshe Y. Vardi:
  Robust Satisfaction. 383-398
  
• Gerald Lüttgen, Michael von der Beeck, Rance Cleaveland:
  Statecharts Via Process Algebra. 399-414
  
• José Meseguer, Carolyn L. Talcott:
  A Partial Order Event Model for Concurrent Objects. 415-430
  
• Marius Minea:
  Partial Order Reduction for Model Checking of Timed Automata. 431-446
  
• Rémi Morin, Brigitte Rozoy:
  On the Semantics of Place/Transition Nets. 447-462
  
• Flemming Nielson, Hanne Riis Nielson, René Rydhof Hansen, Jacob Grydholt Jensen:
  Validating Firewalls in Mobile Ambients. 463-477
  
• Thomas Noll:
  On Coherence Properties in Team Rewriting Models of Concurrency. 478-493
  
• David Nowak, Jean-Pierre Talpin, Paul Le Guernic:
  Synchronous Structures. 494-509
  
• Antti Puhakka, Antti Valmari:
  Weakest-Congruence Results for Livelock-Preserving Equivalences. 510-524
  
• Christine Röckl, Javier Esparza:
  Proof-Checking Protocols Using Bisimulations. 525-540
  
• Glynn Winskel:
  Event Structures as Presheaves -Two Representation Theorems. 541-556
  
• Nobuko Yoshida, Matthew Hennessy:
  Suptyping and Locality in Distributed Higher Order Processes (extended abstract). 557-572