CONCUR 2000 — Concurrency Theory: 11th International Conference University Park, PA, USA, August 22–25, 2000 ProceedingsAuthor: Catuscia Palamidessi Published by Springer Berlin Heidelberg ISBN: 978-3-540-67897-7 DOI: 10.1007/3-540-44618-4Table of Contents:Combining Theorem Proving and Model Checking through Symbolic Analysis Verification Is Experimentation! Compositional Performance Analysis Using Probabilistic I/O Automata Formal Models for Communication-Based Design Programming Access Control: The Klaim Experience Exploiting Hierarchical Structure for Efficient Formal Verification From Process Calculi to Process Frameworks Verification Using Tabled Logic Programming Open Systems in Reactive Environments: Control and Synthesis Model Checking with Finite Complete Prefixes Is PSPACE-Complete Verifying Quantitative Properties of Continuous Probabilistic Timed Automata The Impressive Power of Stopwatches Optimizing Büchi Automata Generalized Model Checking: Reasoning about Partial State Spaces Reachability Analysis for Some Models of Infinite-State Transition Systems Process Spaces Failure Semantics for the Exchange of Information in Multi-Agent Systems Proof-Outlines for Threads in Java Deriving Bisimulation Congruences for Reactive Systems Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic