CONCUR 2000 - Concurrency Theory

1. Front Matter

   Pages I-XI

   PDF

2. Invited Talks

   1. Combining Theorem Proving and Model Checking through Symbolic Analysis

      • Natarajan Shankar

      Pages 1-16

   2. Verification Is Experimentation!

      • Ed Brinksma

      Pages 17-24

   3. Compositional Performance Analysis Using Probabilistic I/O Automata

      • Eugene W. Stark

      Pages 25-28

   4. Formal Models for Communication-Based Design

      • Alberto Sangiovanni-Vincentelli, Marco Sgroi, Luciano Lavagno

      Pages 29-47

3. Invited Tutorials

   1. Programming Access Control: The Klaim Experience

      • Rocco De Nicola, GianLuigi Ferrari, Rosario Pugliese

      Pages 48-65

   2. Exploiting Hierarchical Structure for Efficient Formal Verification

      • Rajeev Alur

      Pages 66-68

   3. From Process Calculi to Process Frameworks

      • Philippa Gardner

      Pages 69-88

   4. Verification Using Tabled Logic Programming

      • C. R. Ramakrishnan

      Pages 89-91

4. Accepted Papers

   1. Open Systems in Reactive Environments: Control and Synthesis

      • Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi

      Pages 92-107

   2. Model Checking with Finite Complete Prefixes Is PSPACE-Complete

      • Keijo Heljanko

      Pages 108-122

   3. Verifying Quantitative Properties of Continuous Probabilistic Timed Automata

      • Marta Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston

      Pages 123-137

   4. The Impressive Power of Stopwatches

      • Franck Cassez, Kim Larsen

      Pages 138-152

   5. Optimizing Büchi Automata

      • Kousha Etessami, Gerard J. Holzmann

      Pages 153-168

   6. Generalized Model Checking: Reasoning about Partial State Spaces

      • Glenn Bruns, Patrice Godefroid

      Pages 168-182

   7. Reachability Analysis for Some Models of Infinite-State Transition Systems

      • Oscar H. Ibarra, Tevfik Bultan, Jianwen Su

      Pages 183-198

   8. Process Spaces

      • Radu Negulescu

      Pages 199-213

   9. Failure Semantics for the Exchange of Information in Multi-Agent Systems

      • Frank S. de Boer, Rogier M. van Eijk, Wiebe van der Hoek, John-Jules Ch. Meyer

      Pages 214-228

   10. Proof-Outlines for Threads in Java

       • Erika Ábrahám-Mumm, Frank S. de Boer

       Pages 229-242

   11. Deriving Bisimulation Congruences for Reactive Systems

       • James J. Leifer, Robin Milner

       Pages 243-258

This volume contains the proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000) held in State College, Pennsylvania, USA, during 22-25 August 2000. The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their - plications, and of the scienti?c relevance of their foundations. The scope covers all areas of semantics, logics, and veri?cation techniques for concurrent systems. Topics include concurrency related aspects of: models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model-checking, veri?cation techniques, re?nement te- niques, term and graph rewriting, distributed programming, logic constraint p- gramming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and veri?cation. The ?rst two CONCUR conferences were held in Amsterdam (NL) in 1990 and 1991. The following ones in Stony Brook (USA), Hildesheim (D), Uppsala (S), Philadelphia (USA), Pisa (I), Warsaw (PL), Nice (F), and Eindhoven (NL). The proceedings have appeared in Springer LNCS, as Volumes 458, 527, 630, 715, 836, 962, 1119, 1243, 1466, and 1664.

• Algorithms
• Constraint
• algorithm
• distributed programming
• logic
• model checking
• petri net
• programming
• real-time
• verification

• Department of Computer Science and Engineering, Pennsylvania State University, University Park, USA

  Catuscia Palamidessi

Policies and ethics