CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings (Q1188866): Difference between revisions

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