1. CONCUR 1990: Amsterdam, The Netherlands

Invited Lectures

• Eike Best:
  Partial Order Semantics of Concurrent Programs (Abstract). 1
  
• Roberto Gorrieri, Ugo Montanari:
  SCONE: A Simple Calculus of Nets. 2-30
  
• Matthew Hennessy:
  Value-Passing in Process Algebras (Abstract). 31
  
• C. A. R. Hoare:
  Let's Make Models (Abstract). 32
  
• Kim Guldstrand Larsen:
  Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability + ... 33-56
  

Selected Presentations

• Martín Abadi:
  An Axiomatization of Lamport's Temporal Logic of Actions. 57-69
  
• Anish Arora, Paul C. Attie, Michael Evangelist, Mohamed G. Gouda:
  Convergence of Iteration Systems (Extended Abstract). 70-82
  
• Jos C. M. Baeten, Jan A. Bergstra:
  Process Algebra with a Zero Object. 83-98
  
• Frank S. de Boer, Catuscia Palamidessi:
  On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on Sequences. 99-114
  
• Julian C. Bradfield, Colin Stirling:
  Verifying Temporal Properties of Processes. 115-125
  
• Ivan Christoff:
  Testing Equivalences and Fully Abstract Models for Probabilistic Processes. 126-140
  
• Rance Cleaveland, Bernhard Steffen:
  A Preorder for Partial Process Specifications. 141-151
  
• Rocco De Nicola, Ugo Montanari, Frits W. Vaandrager:
  Back and Forth Bisimulations. 152-165
  
• Jörg Desel:
  Reduction and Design of Well-behaved Concurrent Systems. 166-181
  
• Javier Esparza:
  Synthesis Rules for Petri Nets, and How they Lead to New Results. 182-198
  
• Alan Fekete, Nancy A. Lynch:
  The Need for Headers: An Impossibility Result for Communication over Unreliable Channels. 199-215
  
• Yulin Feng, Junbo Liu:
  A Temporal Approach to Algebraic Specifications. 216-229
  
• Nissim Francez, Ira R. Forman:
  Superimposition for Interacting Processes. 230-245
  
• Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow:
  An Implementation of a Translational Semantics for an Imperative Language. 246-262
  
• Richard Gerber, Insup Lee:
  CCSR: A Calculus for Communicating Shared Resources. 263-277
  
• Rob J. van Glabbeek:
  The Linear Time-Branching Time Spectrum (Extended Abstract). 278-297
  
• E. Pascal Gribomont:
  A Programming Logic for Formal Concurent Systems. 298-313
  
• Jan Friso Groote:
  A New Strategy for Proving omega-Completeness applied to Process Algebra. 314-331
  
• Jan Friso Groote:
  Transition System Specifications with Negative Premises (Extended Abstract). 332-341
  
• Mark B. Josephs, Jan Tijmen Udding:
  Delay-Insensitive Circuits: An Algebraic Approach to their Design. 342-366
  
• Chi-Chang Jou, Scott A. Smolka:
  Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. 367-383
  
• José Meseguer:
  Rewriting as a Unified Model of Concurrency. 384-400
  
• Faron Moller, Chris M. N. Tofts:
  A Temporal Calculus of Communicating Systems. 401-415
  
• Pawel Paczkowski:
  Proving Termination of Communicating Programs. 416-426
  
• Huajun Qin, Philip Lewis:
  Factorization of Finite State Machines under Observational Equivalence. 427-441
  
• Antonia Sinachopoulos:
  Partial Order Logics for Elementary Net Systems: State- and Event-approaches. 442-455
  
• Scott A. Smolka, Bernhard Steffen:
  Priority as Extremal Probability. 456-466
  
• Chris M. N. Tofts:
  A Synchronous Calculus of Relative Frequency. 467-480
  
• Glynn Winskel:
  On the Compositional Checking of Validity (Extended Abstract). 481-501
  
• Wang Yi:
  Real-Time Behaviour of Asynchronous Agents. 502-520
  
• Serge Yoccoz:
  Effective Solutions to Domain Equations - An Approach to Effective Denotational Semantics. 521-536