Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1997

CONCUR'97: Concurrency Theory

8th International Conference, Warsaw, Poland, July 1-4, 1997, Proceedings

Editors:

  1. Antoni Mazurkiewicz
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Józef Winkowski
    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 1243)

Conference series link(s): CONCUR: International Conference on Concurrency Theory

Conference proceedings info: CONCUR 1997.

Sections

Buy it now

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

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

Table of contents (28 papers)

  1. Front Matter

    PDF

  3. Partial-order reduction in the weak modal mu-calculus

    • Y. S. Ramakrishna, Scott A. Smolka
    Pages 5-24

  4. Cyclic vector languages

    • M. W. Shields
    Pages 25-44

  5. A product version of dynamic linear time temporal logic

    • Jesper G. Henriksen, P. S. Thiagarajan
    Pages 45-58

  6. Reasoning about cryptographic protocols in the spi calculus

    • Martín Abadi, Andrew D. Gordon
    Pages 59-73

  7. Modularity for timed and hybrid systems

    • Rajeev Alur, Thomas A. Henzinger
    Pages 74-88

  8. A universal reactive machine

    • Henrik Reif Andersen, Simon Mørk, Morten Ulrik Sørensen
    Pages 89-103

  9. Bounded stacks, bags and queues

    • J. C. M. Baeten, J. A. Bergstra
    Pages 104-118

  10. Adding partial orders to linear temporal logic

    • Girish Bhat, Doron Peled
    Pages 119-134

  11. Reachability analysis of pushdown automata: Application to model-checking

    • Ahmed Bouajjani, Javier Esparza, Oded Maler
    Pages 135-150

  12. Synthesis of nets with inhibitor arcs

    • Nadia Busi, G. Michele Pinna
    Pages 151-165

  13. An algebraic theory of multiple clocks

    • Rance Cleaveland, Gerald Lüttgen, Michael Mendler
    Pages 166-180

  14. Horizontal and vertical structuring techniques for statecharts

    • Hartmut Ehrig, Robert Geisler, Marcus Klar, Julia Padberg
    Pages 181-195

  15. Implicit typing à la ML for the join-calculus

    • Cédric Fournet, Luc Maranget, Cosimo Laneve, Didier Rémy
    Pages 196-212

  17. Axiomatizing flat iteration

    • R. J. van Glabbeek
    Pages 228-242

  18. Probabilistic concurrent constraint programming

    • Vineet Gupta, Radha Jagadeesan, Vijay Saraswat
    Pages 243-257

  19. On the complexity of verifying concurrent transition systems

    • David Harel, Orna Kupferman, Moshe Y. Vardi
    Pages 258-272

  20. Fair simulation

    • Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani
    Pages 273-287
Back to top

Other Volumes

  1. CONCUR '97: Concurrency Theory

Back to top

About this book

This book constitutes the refereed proceedings of the 8th International Conference on Concurrency Theory, CONCUR'97. held in Warsaw, Poland, in July 1997.
The 24 revised full papers presented were selected by the program committee for inclusion in the volume from a total of 41 high-quality submissions. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model checking, partial orders, state charts, program logic calculi, infinite state systems, verification, and others.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation