Skip to main content
SpringerLink
Log in

CONCUR '95 Concurrency Theory

6th International Conference, Philadelphia, PA, USA, August 21 - 24, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Insup Lee
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Scott A. Smolka
    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 962)

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

Licence this eBook for your library

Institutional subscriptions

Table of contents (40 papers)

  1. Front Matter

    Download chapter PDF

  2. Local model checking games (extended abstract)

    • Colin Stirling
    Pages 1-11

  3. Compositional proof systems for model checking infinite state processes

    • Mads Dam
    Pages 12-26

  4. Compositional model checking of real time systems

    • François Laroussinie, Kim G. Larsen
    Pages 27-41

  5. Checking bisimilarity for finitary π-calculus

    • Ugo Montanari, Marco Pistore
    Pages 42-56

  6. The weak late π-calculus semantics as observation equivalence

    • Gian-Luigi Ferrari, Ugo Montanari, Paola Quaglia
    Pages 57-71

  7. The fixpoint-analysis machine

    • Bernhard Steffen, Andreas Claßen, Marion Klein, Jens Knoop, Tiziana Margaria
    Pages 72-87

  8. Unique fixpoint induction for mobile processes

    • H. Lin
    Pages 88-102

  9. A polymorphic type system for the polyadic π-calculus

    • Xinxin Liu, David Walker
    Pages 103-116

  10. Fibrational control structures

    • Claudio Hermida, John Power
    Pages 117-129

  11. Fully abstract models for nondeterministic regular expressions

    • Flavio Corradini, Rocco De Nicola, Anna Labella
    Pages 130-144

  12. A Petri net semantics for π-calculus

    • Nadia Busi, Roberto Gorrieri
    Pages 145-159

  13. A complete theory of deterministic event structures

    • Arend Rensink
    Pages 160-174

  14. Characterizing behavioural congruences for Petri nets

    • Mogens Nielsen, Lutz Priese, Vladimiro Sassone
    Pages 175-189

  15. Verification of a distributed summation algorithm

    • Frits Vaandrager
    Pages 190-203

  16. Confluence for process verification

    • J. F. Groote, M. P. A. Sellink
    Pages 204-218

  17. Axiomatisations of weak equivalences for De Simone languages

    • Irek Ulidowski
    Pages 219-233

  18. A compositional trace-based semantics for probabilistic automata

    • Roberto Segala
    Pages 234-248

  19. Acceptance trees for probabilistic processes

    • Manuel Núñez, David de Frutos, Luis Llana
    Pages 249-263

  20. Will I be pretty, will I be rich? Some thoughts on theory vs. practice in systems engineering

    • David Harel
    Pages 264-268
Back to top

Keywords

About this book

This book constitutes the proceedings of the 6th International Conference on Concurrency Theory, CONCUR '95, held in Philadelphia, Pennsylvania in August 1995.
The volume presents seven invited contributions by outstanding researchers and 33 refereed full research papers selected by the program committee out of a total of 91 submissions. The collection of articles gives a representative overview on what happened in this area of research, since the last CONCUR conference took place. There are sections on model checking, mobile processes, process theory, true concurrency, process algebra, probabilistic automata, real-time systems, testing semantics, decidability results, refinement theory, and linear-time logics.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation