Skip to main content
SpringerLink
Log in
Book cover

CONCUR'93

4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993. Proceedings

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. Eike Best
    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 715)

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

Table of contents (37 papers)

  1. Front Matter

    Download chapter PDF

  2. The lambda-calculus with multiplicities

    • Gérard Boudol
    Pages 1-6

  3. A multiset semantics for the pi-calculus with replication

    • Joost Engelfriet
    Pages 7-21

  4. Model checking mobile processes

    • Mads Dam
    Pages 22-36

  5. A practical technique for process abstraction

    • Glenn Bruns
    Pages 37-49

  6. Modular completeness for Communication Closed Layers

    • Maarten Fokkinga, Mannes Poel, Job Zwiers
    Pages 50-65

  7. The linear time — Branching time spectrum II

    • R. J. van Glabbeek
    Pages 66-81

  8. A classification of models for concurrency

    • Vladimiro Sassone, Mogens Nielsen, Glynn Winskel
    Pages 82-96

  9. On the ill-timed but well-caused

    • Luca Aceto, David Murphy
    Pages 97-111

  10. On the reduction of chocs bisimulation to π-calculus bisimulation

    • Roberto M. Amadio
    Pages 112-126

  11. A theory of bisimulation for the π-calculus

    • Davide Sangiorgi
    Pages 127-142

  12. Bisimulation equivalence is decidable for basic parallel processes

    • Søren Christensen, Yoram Hirshfeld, Faron Moller
    Pages 143-157

  13. A pi-calculus semantics for an object-based design notation

    • C. B. Jones
    Pages 158-172

  14. Programming with broadcasts

    • K. V. S. Prasad
    Pages 173-187

  15. Interpreting broadcast communication in SCCS

    • Uno Holmer
    Pages 188-201

  16. Proof systems for message-passing process algebras

    • M. Hennessy, H. Lin
    Pages 202-216

  17. Refinement and decomposition of value-passing action systems

    • Michael J. Butler
    Pages 217-232

  18. Partial-order methods for temporal verification

    • Pierre Wolper, Patrice Godefroid
    Pages 233-246

  19. Model construction for implicit specifications in modal logic

    • Ole Høgh Jensen, Christian Jeppesen, Jarl Tuxen Lang, Kim Guldstrand Larsen
    Pages 247-261

  20. Branching time temporal logic and amorphous tree automata

    • Orna Bernholtz, Orna Grumberg
    Pages 262-277
Back to top

Keywords

About this book

This volume contains the proceedings of CONCUR '93, the fourth in an annual series of conferences devoted to the study of concurrency. The basic aim of the CONCUR conferences is to communicate advances in concurrency theory and applications. The volume contains 31 papers selected from 113submissions, together with four invited papers and two abstracts of invited talks. The invited talks are: "The lambda-calculus with multiplicities" (extended abstract) by G rard Boudol, "A pi-calculus semantics for an object-based design notation" by Cliff B. Jones, "Partial-order methods for temporal verification" by Pierre Wolper and Patrice Godefroid, "Non-interleaving process algebra" by Jos C.M. Baetenand Jan A. Bergstra, "Loop parallelization in the polytope model" by Christian Lengauer, and "Structured operational semantics for process algebras and equational axiom systems" (abstract) by Bard Bloom.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation