8. CONCUR 1997: Warsaw, Poland

Invited Talks

• Jeremy Gunawardena:
  Recent Developments in the Mathematics of Reactive Systems (Extended Abstract). 1-4
  
• Y. S. Ramakrishna, Scott A. Smolka:
  Partial-Order Reduction in the Weak Modal Mu-Calculus. 5-24
  
• M. W. Shields:
  Cyclic Vector Languages. 25-44
  
• Jesper G. Henriksen, P. S. Thiagarajan:
  A Product Version of Dynamic Linear Time Temporal Logic. 45-58
  

Contributions

• Martín Abadi, Andrew D. Gordon:
  Reasoning about Cryptographic Protocols in the Spi Calculus. 59-73
  
• Rajeev Alur, Thomas A. Henzinger:
  Modularity for Timed and Hybrid Systems. 74-88
  
• Henrik Reif Andersen, Simon Mørk, Morten Ulrik Sørensen:
  A Universal Reactive Machine. 89-103
  
• Jos C. M. Baeten, Jan A. Bergstra:
  Bounded Stacks, Bags and Queues. 104-118
  
• Girish Bhat, Doron Peled:
  Adding Partial Orders to Linear Temporal Logic. 119-134
  
• Ahmed Bouajjani, Javier Esparza, Oded Maler:
  Reachability Analysis of Pushdown Automata: Application to Model-Checking. 135-150
  
• Nadia Busi, G. Michele Pinna:
  Synthesis of Nets with Inhibitor Arcs. 151-165
  
• Rance Cleaveland, Gerald Lüttgen, Michael Mendler:
  An Algebraic Theory of Multiple Clocks. 166-180
  
• Hartmut Ehrig, Robert Geisler, Marcus Klar, Julia Padberg:
  Horizontal and Vertical Structuring Techniques for Statecharts. 181-195
  
• Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy:
  Implicit Typing à la ML for the Join-Calculus. 196-212
  
• Laurent Fribourg, Hans Olsén:
  Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. 213-227
  
• Rob J. van Glabbeek:
  Axiomatizing Flat Iteration. 228-242
  
• Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat:
  Probabilistic Concurrent Constraint Programming. 243-257
  
• David Harel, Orna Kupferman, Moshe Y. Vardi:
  On the Complexity of Verifying Concurrent Transition Systems. 258-272
  
• Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani:
  Fair Simulation. 273-287
  
• Hanna Klaudel, Robert-C. Riemann:
  High Level Expressions with their SOS Semantics (Extended Abstract). 288-301
  
• Antonín Kucera:
  How to Parallelize Sequential Processes. 302-316
  
• Rom Langerak, Ed Brinksma, Joost-Pieter Katoen:
  Causal Ambiguity and Partial Orders in Event Structures. 317-331
  
• Richard Mayr:
  Model Checking PA-Processes. 332-346
  
• Anna Patterson:
  Bisimulation and Propositional Intuitionistic Logic. 347-360
  
• Anna Philippou, David Walker:
  A Rigorous Analysis of Concurrent Operations on B-Trees. 361-375
  
• Peter Selinger:
  First-Order Axioms for Asynchrony. 376-390
  
• Peter Sewell:
  On Implementations and Semantics of a Concurrent Programming Language. 391-405
  
• Harro Wimmel, Lutz Priese:
  Algebraic Characterization of Petri Net Pomset Semantics. 406-420