Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

CONCUR '90: Theories of Concurrency: Unification and Extension

Theories of Concurrency: Unification and Extension

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. J. C. M. Baeten
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. J. W. Klop
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 458)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This volume gives the proceedings of the conference CONCUR '90. This is the first conference organized by ESPRIT Basic Research Action 3006, CONCUR (Theories of Concurrency: Unification and Extension), started in September 1989. The principal aims of the action are to explore the relationships among the different approaches to algebraic concurrency theory, and to develop a formalism applicable to a wide range of case studies. The articles in this volume describe the state of the art in concurrency, the theory of communicating concurrent (or distributed) systems.

Keywords

Table of contents (36 papers)

  1. Front Matter

    Download chapter PDF

  2. Partial order semantics of concurrent programs

    • Eike Best
    Pages 1-1

  3. SCONE: A simple calculus of nets

    • Roberto Gorrieri, Ugo Montanari
    Pages 2-30

  4. Value-passing in process algebras

    • M. Hennessy
    Pages 31-31

  5. Let's make models

    • C. A. R. Hoare
    Pages 32-32

  6. Ideal specification formalism = expressivity + compositionality + decidability + testability + ...

    • Kim Guldstrand Larsen
    Pages 33-56

  7. An axiomatization of Lamport's temporal logic of actions

    • Martín Abadi
    Pages 57-69

  8. Convergence of iteration systems

    • Anish Arora, Paul Attie, Michael Evangelist, Mohamed Gouda
    Pages 70-82

  9. Process algebra with a zero object

    • J. C. M. Baeten, J. A. Bergstra
    Pages 83-98

  10. On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences

    • Frank S. de Boer, Catuscia Palamidessi
    Pages 99-114

  11. Verifying temporal properties of processes

    • Julian Bradfield, Colin Stirling
    Pages 115-125

  12. Testing equivalences and fully abstract models for probabilistic processes

    • Ivan Christoff
    Pages 126-138

  13. A preorder for partial process specifications

    • Rance Cleaveland, Bernhard Steffen
    Pages 141-151

  14. Back and forth bisimulations

    • Rocco De Nicola, Ugo Montanari, Frits Vaandrager
    Pages 152-165

  15. Reduction and design of well-behaved concurrent systems

    • Jörg Desel
    Pages 166-181

  16. Synthesis rules for Petri nets, and how they lead to new results

    • Javier Esparza
    Pages 182-198

  17. The need for headers: An impossibility result for communication over unreliable channels

    • Alan Fekete, Nancy Lynch
    Pages 199-214

  18. A temporal approach to algebraic specifications

    • Yulin Feng, Junbo Liu
    Pages 216-229

  19. Superimposition for interacting processes

    • Nissim Francez, Ira R. Forman
    Pages 230-245

  20. An implementation of a translational semantics for an imperative language

    • Lars-åke Fredlund, Bengt Jonsson, Joachim Parrow
    Pages 246-262
Back to top

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation