The conference CONCUR’90 marks the end of the first year of CONCUR (Theories of concurrency: unification and extension). From 54 papers submitted, 31 were selected for presentation by the program committee, together with two articles by invited speakers: “SCONE: a simple calculus of nets”, by R. Gorrieri and U. Montanari, and “Ideal specification formalism = expressivity + compositionality + decidability + testability + …”, by K. L. Larsen. Other three invited speakers are only represented by abstracts: “Partial order semantics of concurrent programs”, by E. Best, “Value-passing in process algebras”, by M. Hennessy, and “Let’s make models”, by C. A. R. Hoare.
Table of contents (excepting the papers mentioned above): M. Abadi, An axiomatization of Lamport’s temporal logic of actions (pp. 57-69); A. Arora, P. Attie, A. Evangelist, and M. Gouda, Convergence of iteration systems (pp. 70-82); J. C. M. Baeten, and J. A. Bergstra, Process algebra with a zero object (pp. 83-98); F. S. de Boer and C. Palamidessi, On the asynchronous nature of communication in concurrent logic languages: a fully abstract model based on sequences (pp. 99-114); J. Bradfield and C. Stirling, Verifying temporal properties of processes (pp. 115-125); I. Christoff, Testing equivalence and fully abstract model for probabilistic processes (pp. 126-140); R. Cleaveland and B. Steffen, A preorder for partial process specifications (pp. 141-151); R. De Nicola, U. Montanari and F. Vandrager, Back and forth bisimulations (pp. 152-165); J. Desel, Reduction and design of well-behaved concurrent systems (pp. 166-181); J. Esparza, Synthesis rules for Petri nets, and how they lead to new results (pp. 182-198); A. Fekete and N. Lynch, The need for headers: an impossibility result for communication over unreliable channels (pp. 199- 215); Y. Feng, and J. Liu, A temporal approach to algebraic specifications (pp. 216-229); N. Francez and I. R. Forman, Superimposition for interaction processes (pp. 230-245); L. Fredlung, B. Jonsson and J. Parrow, An implementation of a translation semantics for an imperative language (pp. 246-262); R. Gerber and I. Lee, CCSR: a calculus for communicating shared resources (pp. 263-277); R. J. van Glabbeek, The linear time- branching time spectrum (pp. 278-297); E. P. Gribomont, A programming logic for formal concurrent systems (pp. 298-313); J. F. Groote, A new strategy for proving \(\omega\)-completeness applied to process algebra (pp. 314-331); J. F. Groote, Transition system specification with negative premises (pp. 332-341); M. B. Josephs and J. T. Udding, Delay-insensitive circuits: an algebraic approach to their design (pp. 342-366); C. C. Jou and S. A. Smolka, Equivalences, congruences, and complete axiomatizations for probabilistic processes (pp. 367-383); J. Mesequer, Rewriting as a unified model of concurrency (pp. 384-400); F. Moller and C. Tofts, A temporal calculus of communicating systems (pp. 401-415); P. Paczkowski, Proving termination of communicating programs (pp. 416-426); H. Qin and P. Lewis, Factorization of finite state machines under observational equivalences (pp. 427-441); A. Sinacholoulos, Partial order logics for elementary net systems: state- and event- approaches (pp. 442-455); S. A. Smolka and B. Steffen, Priority as extremal probability (pp. 456-466); C. Tofts, A synchronous calculus of relative frequency (pp. 467-480); G. Winskel, On the compositional checking of validity (pp. 481-501); W. Yi, Real-time behaviour of asynchronous agents (pp. 502-520); S. Yoccoz, Effective solutions to domain equations: an approach to effective denotational semantics (pp. 521-536).
The articles of this volume will not be indexed individually.