Skip to main content
SpringerLink
Log in
SpringerLink
Log in

CONCUR '96: Concurrency Theory

7th International Conference, Pisa, Italy, August 26 - 29, 1996. Proceedings

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Ugo Montanari
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Vladimiro Sassone
    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 1119)

Included in the following conference series:

Conference proceedings info: CONCUR 1996.

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 109.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 (44 papers)

  1. Front Matter

    Download chapter PDF

  2. Retracing some paths in process algebra

    • Samson Abramsky
    Pages 1-17

  3. Process calculus based upon evaluation to committed form

    • Andrew M. Pitts, Joshua R. X. Ross
    Pages 18-33

  4. A process algebra with distributed priorities

    • Rance Cleaveland, Gerald Lüttgen, V. Natarajan
    Pages 34-49

  5. Symbolic transition graph with assignment

    • Huimin Lin
    Pages 50-65

  6. Models for concurrent constraint programming

    • Vineet Gupta, Radha Jagadeesan, Vijay Saraswat
    Pages 66-83

  7. Comparing transition systems with independence and asynchronous transition systems

    • Thomas T. Hildebrandt, Vladimiro Sassone
    Pages 84-97

  8. A presheaf semantics of value-passing processes

    • Glynn Winskel
    Pages 98-114

  9. Elementary control structures

    • John Power
    Pages 115-130

  10. On transformations of concurrent object programs

    • Anna Philippou, David Walker
    Pages 131-146

  11. On bisimulations for the asynchronous π-calculus

    • Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi
    Pages 147-162

  12. On the expressiveness of internal mobility in name-passing calculi

    • Michele Boreale
    Pages 163-178

  13. Decoding choice encodings

    • Uwe Nestmann, Benjamin C. Pierce
    Pages 179-194

  14. Infinite results

    • Faron Moller
    Pages 195-216

  15. Decidability of bisimulation equivalence for normed pushdown processes

    • Colin Stirling
    Pages 217-232

  16. The modal mu-calculus alternation hierarchy is strict

    • J. C. Bradfield
    Pages 233-246

  17. Bisimulation collapse and the process taxonomy

    • Olaf Burkart, Didier Caucal, Bernhard Steffen
    Pages 247-262

  18. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic

    • David Janin, Igor Walukiewicz
    Pages 263-277

  19. A Facile tutorial

    • Bent Thomsen, Lone Leth, Tsung-Min Kuo
    Pages 278-298

  20. Testing probabilistic automata

    • Roberto Segala
    Pages 299-314
Back to top

Other volumes

  1. CONCUR '96: Concurrency Theory

Keywords

About this book

This book constitutes the refereed proceedings of the 7th International Conference on Concurrency Theory, CONCUR '96, held in Pisa, Italy, in August 1996.
The volume presents 37 revised full papers selected from a total of 133 submissions; also included are seven invited papers. The contributions are grouped into topical sections on process algebras, categorical approaches, the pi-calculus, decidability and complexity, probability, functional and constraint programming, Petri nets, verification, automata and causality, practical models, and shared-memory systems.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation