2. CONCUR 1991: Amsterdam, The Netherlands

Invited Lectures

• Pierre America:
  Formal Techniques for Parallel Object-Oriented Languages. 1-17
  
• Amar Bouali, Robert de Simone:
  Causal Models for Rational Algebraic Processes. 18-19
  
• Rocco De Nicola:
  Action and State-based Logics for Process Algebras. 20-22
  
• Jean-Claude Fernandez, Laurent Mounier:
  A Tool Set for deciding Behavioral Equivalences. 23-42
  
• Ursula Goltz:
  Causality Based Models for the Design of Concurrent Systems. 43-44
  
• Robin Milner, Joachim Parrow, David Walker:
  Modal Logics for Mobile Processes. 45-60
  
• Ernst-Rüdiger Olderog:
  Towards a Design Calculus for Communicationg Programs. 61-77
  

Selected Presentations

• Luca Aceto, Anna Ingólfsdóttir:
  A Theory of Testing for ACP. 78-95
  
• Jos C. M. Baeten, Jan A. Bergstra:
  Real Space Process Algebra. 96-110
  
• Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten:
  The Failure of Failures in a Paradigm for Asynchronous Communication. 111-126
  
• Frank S. de Boer, Catuscia Palamidessi:
  Embedding as a Tool for Language Comparison: On the CSP Hierarchy. 127-141
  
• Juanito Camilleri:
  A Conditional Operator for CCS. 142-156
  
• Nicolien J. Drost:
  Algebraic Formulations of Trace Theory. 157-171
  
• Javier Esparza, Manuel Silva:
  Compositional Synthesis of Live and Bounded Free Choice Petri Nets. 172-187
  
• Gian Luigi Ferrari, Ugo Montanari:
  The Observation Algebra of Spatial Pomsets. 188-202
  
• Nissim Francez, Ira R. Forman:
  Synchrony Loosening Transformations for Interacting Processes. 203-219
  
• Kenneth J. Goldman:
  A Compositional Model for Layered Distributed Systems. 220-234
  
• Jan Friso Groote, Alban Ponse:
  Process Algebra with Guards - Combining Hoare Logic with Process Algebra (Extended Abstract). 235-249
  
• Orna Grumberg, David E. Long:
  Model Checking and Modular Verification. 250-265
  
• Jeremy Gunawardena:
  Geometric Logic, Causality and Event Structures. 266-280
  
• Jean-Marie Jacquet, Luís Monteiro:
  Extended Horn Clauses: The Framework and Some Semantics. 281-297
  
• Wil Janssen, Mannes Poel, Job Zwiers:
  Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach. 298-316
  
• Ryszard Janicki, Maciej Koutny:
  Invariant Semantics of Nets with Inhibitor Arcs. 317-331
  
• Alan Jeffrey:
  Abstract Timed Observation and Process Algebra. 332-345
  
• Bengt Jonsson:
  Simulations Between Specifications of Distributed Systems. 346-360
  
• Roope Kaivola, Antti Valmari:
  Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models. 361-375
  
• Steven Klusener:
  Completeness in Real Time Process Algebra. 376-392
  
• Padmanabhan Krishnan:
  Distributed CCS. 393-407
  
• Michael Merritt, Francesmary Modugno, Marc R. Tuttle:
  Time-Constrained Automata (Extended Abstract). 408-423
  
• Faron Moller, Chris M. N. Tofts:
  Relating Processes With Respect to Speed. 424-438
  
• David Murphy:
  Testing, Betting and Timed True Concurrency. 439-454
  
• Doris Nolte, Lutz Priese:
  Fairness in Models with True Concurrency. 455-469
  
• Huajun Quin:
  Efficient Verification of Determinate Processes. 470-479
  
• Ph. Schnoebelen:
  Experiments on Processes with Backtracking. 480-494
  
• Paul Spruit, Roel Wieringa:
  Some Finite-Graph Models for Process Algebra. 495-509
  
• Ketil Stølen:
  A Method for the Development of Totally Correct Shared-State Parallel Programs. 510-525
  
• Antti Valmari, Matthew Clegg:
  Reduced Labelled Transition Systems Save Verification Effort. 526-540