Skip to main content
SpringerLink
Log in
Book cover

CONCUR '98 Concurrency Theory

9th International Conference, Nice, France, September 8-11, 1998, Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Davide Sangiorgi
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Robert Simone
    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 1466)

Included in the following conference series:

Conference proceedings info: CONCUR 1998.

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 (41 papers)

  1. Front Matter

    Download chapter PDF

  2. Sometimes and not never re-revisited: on branching versus linear time

    • Moshe Y. Vardi
    Pages 1-17

  3. Controllers for discrete event systems via morphisms

    • P. Madhusudan, P. S. Thiagarajan
    Pages 18-33

  4. Synthesis from knowledge-based specifications

    • Ron van der Meyden, Moshe Y. Vardi
    Pages 34-49

  5. The regular viewpoint on PA-processes

    • D. Lugiez, Ph. Schnoebelen
    Pages 50-66

  6. Herbrand automata for hardware verification

    • W. Damm, A. Pnueli, S. Ruah
    Pages 67-83

  7. Control flow analysis for the π-calculus

    • Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
    Pages 84-98

  8. The tau-laws of fusion

    • Joachim Parrow, Björn Victor
    Pages 99-114

  9. From higher-order π-calculus to π-calculus in the presence of static operators

    • José-Luis Vivas, Mads Dam
    Pages 115-130

  10. Minimality and separation results on asynchronous mobile processes

    • Nobuko Yoshida
    Pages 131-146

  11. Abstract games for infinite state processes

    • Perdita Stevens
    Pages 147-162

  12. Alternating refinement relations

    • Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi
    Pages 163-178

  13. Possible worlds process algebras

    • Simone Veglioni, Rocco De Nicola
    Pages 179-193

  14. Automata and coinduction (an exercise in coalgebra)

    • J. J. M. M. Rutten
    Pages 194-218

  15. Axioms for real-time logics

    • J. -F. Raskin, P. -Y. Schobbens, T. A. Henzinger
    Pages 219-236

  16. Priority and maximal progress are completely axiomatisable (extended abstract)

    • Holger Hermanns, Markus Lohrey
    Pages 237-252

  17. Simulation is decidable for one-counter nets

    • Parosh Aziz Abdulla, Karlis Čerāns
    Pages 253-268

  18. From rewrite to bisimulation congruences

    • Peter Sewell
    Pages 269-284

  19. Reasoning about asynchronous communication in dynamically evolving object structures

    • F. S. de Boer
    Pages 285-300

  20. Modelling IP mobility

    • Roberto M. Amadio, Sanjiva Prasad
    Pages 301-316
Back to top

Other volumes

  1. CONCUR'98 Concurrency Theory

Keywords

About this book

This book constitutes the refereed proceedings of the 9th International Conference on Concurrency Theory, CONCUR'98, held in Nice, France, in September 1998.
The 35 revised full papers presented were carefully selected from a total of 104 submissions. Also presented are five invited contributions. Among the topics covered are moduls of computation and semantic domains, process algebras, Petri Nets, event structures, real-time systems, hybrid systems, model checking, verification techniques, refinement, rewriting, typing systems and algorithms, etc..

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation