Skip to main content
SpringerLink
Log in

CONCUR 2002 - Concurrency Theory

13th International Conference, Brno, Czech Republic, August 20-23, 2002. Proceedings

  • Conference proceedings
  • © 2002

Overview

Editors:
  1. Luboš Brim

    1. Faculty of Informatics, Masaryk University Brno, Brno, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Mojmír Křetínský

    1. Faculty of Informatics, Masaryk University Brno, Brno, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Antonín Kučera

    1. Faculty of Informatics, Masaryk University Brno, Brno, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Petr Jančar

    1. Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), Ostrava-Poruba, Czech Republic

    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 2421)

Included in the following conference series:

Conference proceedings info: CONCUR 2002.

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

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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 (39 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Invited Talks

    1. Refinement and Verification Applied to an In-Flight Data Acquisition Unit*

      • Wan Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein
      Pages 1-23

    2. A Deductive Proof System for CTL*

      • Amir Pnueli, Yonit Kesten
      Pages 24-40

    3. Event-State Duality: The Enriched Case

      • Vaughan R. Pratt
      Pages 41-56

    4. Expressive Power of Temporal Logics

      • Alexander Rabinovich
      Pages 57-76

    5. Types, or: Where’s the Difference Between CCS and π?

      • Davide Sangiorgi
      Pages 76-97

  3. Invited Tutorials

    1. Introduction to Modal and Temporal Mu-Calculi

      • Julian C. Bradfield
      Pages 98-98

    2. Types for Cryptographic Protocols

      • Andrew D. Gordon
      Pages 99-100

  4. Verification, Model Checking

    1. Network Invariants in Action*

      • Yonit Kesten, Amir Pnueli, Elad Shahar, Lenore Zuck
      Pages 101-115

    2. Regular Model Checking Made Simple and Effcient*

      • Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso
      Pages 116-131

    3. A Hierarchy of Polynomial-Time Computable Simulations for Automata

      • Kousha Etessami
      Pages 131-144

    4. A Decidable Class of Asynchronous Distributed Controllers

      • P. Madhusudan, P. S. Thiagarajan
      Pages 145-160

    5. Alphabet-Based Synchronisation is Exponentially Cheaper

      • Antti Valmari, Antti Kervinen
      Pages 161-176

    6. Safe Realizability of High-Level Message Sequence Charts*

      • Markus Lohrey
      Pages 177-192

    7. Widening the Boundary between Decidable and Undecidable Hybrid Systems*

      • Eugene Asarin, Gerardo Schneider
      Pages 193-208

  5. Logic

    1. A Spatial Logic for Concurrency (Part II)

      • Luís Caires, Luca Cardelli
      Pages 209-225

    2. Reducing Model Checking from Multi-valued CTL* to CTL*

      • Beata Konikowska, Wojciech Penczek
      Pages 226-239

    3. Local Model Checking Games for Fixed Point Logic with Chop

      • Martin Lange
      Pages 240-254

    4. A Decidable Fixpoint Logic for Time-Outs*

      • Maria Sorea
      Pages 255-272

  6. Mobility

    1. A Calculus of Mobile Resources*

      • Jens Chr. Godskesen, Thomas Hildebrandt, Vladimiro Sassone
      Pages 272-287
Back to top

Other volumes

  1. CONCUR 2002 — Concurrency Theory

Keywords

Editors and Affiliations

  • Faculty of Informatics, Masaryk University Brno, Brno, Czech Republic

    Luboš Brim, Mojmír Křetínský, Antonín Kučera

  • Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), Ostrava-Poruba, Czech Republic

    Petr Jančar

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation