Skip to main content
  • Conference proceedings
  • © 2007

CONCUR 2007 - Concurrency Theory

18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4703)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

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

Conference proceedings info: CONCUR 2007.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (33 papers)

  1. Front Matter

  2. Invited Lectures

    1. The Saga of the Axiomatization of Parallel Composition

      • Luca Aceto, Anna Ingolfsdottir
      Pages 2-16
    2. Rule-Based Modelling of Cellular Signalling

      • Vincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jean Krivine
      Pages 17-41
  3. Contributed Papers

    1. Making Random Choices Invisible to the Scheduler

      • Konstantinos Chatzikokolakis, Catuscia Palamidessi
      Pages 42-58
    2. Strategy Logic

      • Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman
      Pages 59-73
    3. Solving Games Via Three-Valued Abstraction Refinement

      • Luca de Alfaro, Pritam Roy
      Pages 74-89
    4. On Modal Refinement and Consistency

      • Kim G. Larsen, Ulrik Nyman, Andrzej Wąsowski
      Pages 105-119
    5. Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems

      • Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. C. Willemse
      Pages 120-135
    6. Causal Message Sequence Charts

      • Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, P. S. Thiagarajan, Shaofa Yang
      Pages 166-180
    7. Checking Coverage for Infinite Collections of Timed Scenarios

      • S. Akshay, Madhavan Mukund, K. Narayan Kumar
      Pages 181-196
    8. Is Observational Congruence Axiomatisable in Equational Horn Logic?

      • Michael Mendler, Gerald Lüttgen
      Pages 197-211
    9. The Must Preorder Revisited

      • Cosimo Laneve, Luca Padovani
      Pages 212-225
    10. Topology-Dependent Abstractions of Broadcast Networks

      • Sebastian Nanz, Flemming Nielson, Hanne Riis Nielson
      Pages 226-240
    11. On the Expressive Power of Global and Local Priority in Process Calculi

      • Cristian Versari, Nadia Busi, Roberto Gorrieri
      Pages 241-255
    12. A Marriage of Rely/Guarantee and Separation Logic

      • Viktor Vafeiadis, Matthew Parkinson
      Pages 256-271
    13. Fair Cooperative Multithreading

      • Gérard Boudol
      Pages 272-286

Other Volumes

  1. CONCUR 2007 – Concurrency Theory

Keywords

  • Bisimulation
  • automata
  • communication protocols
  • concurrency
  • concurrent processing
  • concurrent rewriting
  • concurrent systems
  • distributed computing
  • formal language
  • formal verification
  • hybrid systems
  • infinite state systems
  • model checking
  • parallel computing
  • semantics

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions