5. CONCUR 1994: Uppsala, Sweden

Invited Lecture

• Jean-Yves Girard:
  Geometry of Interaction (Abstract). 1
  
• Andrew C. Uselton, Scott A. Smolka:
  A Compositional Semantics for Statecharts using Labeled Transition Systems. 2-17
  
• Astrid Kiehn:
  On the Decidability of Non-Interleaving Process Equivalences. 18-33
  
• Sjouke Mauw, Hans Mulder:
  Regularity of BPA-Systems is Decidable. 34-47
  
• Yoram Hirshfeld, Faron Moller:
  A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. 48-63
  

Tutorial

• Jean-Claude Fernandez, Joseph Sifakis, Robert de Simone:
  Model-Based Verification Methods and Tools (Abstract). 64
  
• Mahesh Girkar, Robert Moll:
  New Results on the Analysis of Concurrent Systems with an Infinite Number of Processes. 65-80
  
• Ahmed Bouajjani, Rachid Echahed, Riadh Robbana:
  Verification of Nonregular Temporal Properties for Context-Free Processes. 81-97
  
• Olaf Burkart, Bernhard Steffen:
  Pushdown Processes: Parallel Composition and Model Checking. 98-113
  
• Hardi Hungar:
  Local Model Checking for Parallel Compositions of Context-Free Processes. 114-128
  

Invited Lecture

• Prakash Panangaden:
  The Logical Structure of Concurrent Constraint Programming Languages (Abstract). 129
  
• Pietro Di Gianantonio, Furio Honsell, Silvia Liani, Gordon D. Plotkin:
  Countable Non-Determinism and Uncountable Limits. 130-145
  
• J. Robin B. Cockett, David A. Spooner:
  SProc Categorically. 146-159
  

Tutorial

• Costas Courcoubetis:
  From Timed Graphs to Hybrid Automata (Abstract). 160
  

Invited Lecture

• David L. Dill:
  Hierarchical Models of Synchronous Circuits (Abstract). 161
  
• Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger:
  The Observational Power of Clocks. 162-177
  
• Jeremy Gunawardena:
  A Dynamic Approach to Timed Behaviour. 178-193
  
• Józef Winkowski:
  Algebras of Processes of Timed Petri Nets. 194-209
  
• Maciej Koutny, Javier Esparza, Eike Best:
  Operational Semantics for the Petri Box Calculus. 210-225
  
• Arend Rensink, Heike Wehrheim:
  Weak Sequential Composition in Process Algebras. 226-241
  

Invited Lecture

• Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman:
  Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations. 242-266
  
• Qiwen Xu, Antonio Cau, Pierre Collette:
  On Unifying Assumption-Commitment Style Proof Rules for Concurrency. 267-282
  
• Jens U. Skakkebæk:
  Liveness and Fairness in Duration Calculus. 283-298
  
• Michele Boreale, Rocco De Nicola:
  A Symbolic Semantics for the pi-calculus (Extended Abstract). 299-314
  
• David Walker:
  On Bisimulation in the pi-calculus. 315-330
  
• Xinxin Liu:
  Characterizing Bisimulation Congruence in the pi-Calculus (Extended Abstract). 331-350
  
• Nils Klarlund:
  The Limit View of Infinite Computations. 351-366
  

Tutorial

• Ralph-Johan Back, Joakim von Wright:
  Trace Refinement of Action Systems. 367-384
  

Invited Lecture

• Mogens Nielsen, Christian Clausen:
  Bisimulation for Models in Concurrency. 385-400
  
• Marc Bezem, Jan Friso Groote:
  Invariants in Process Algebra with Data. 401-416
  
• Rance Cleaveland, James Riely:
  Testing-Based Abstractions for Value-Passing Systems. 417-432
  
• Chris Verhoef:
  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises. 433-448
  
• Luca Aceto:
  Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours. 449-464
  
• Jos C. M. Baeten, Jan A. Bergstra:
  Process Algebra with Partial Choice. 465-480
  
• Roberto Segala, Nancy A. Lynch:
  Probabilistic Simulations for Probabilistic Processes. 481-496
  
• Shoji Yuen, Rance Cleaveland, Zeynep Dayar, Scott A. Smolka:
  Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes. 497-512
  
• Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark:
  Composition and Behaviors of Probabilistic I/O Automata. 513-528