Concur 2000 - Concurrency Theory: 11th International Conference, University Park, Pa, Usa, August 22-25, 2000 Proceedings

ISBN-13: 9783540678977 / Angielski / Miękka / 2000 / 613 str.

C. Palamidessi; Catuscia Palamidessi

Opis

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.

Spis treści

Invited Talks.- 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.- Invited Tutorials.- Programming Access Control: The Klaim Experience.- Exploiting Hierarchical Structure for Efficient Formal Verification.- From Process Calculi to Process Frameworks.- Verification Using Tabled Logic Programming.- Accepted Papers.- 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.- Process Languages for Rooted Eager Bisimulation.- Action Contraction.- A Theory of Testing for Markovian Processes.- Reasoning about Probabilistic Lossy Channel Systems.- Weak Bisimulation for Probabilistic Systems.- Nondeterminism and Probabilistic Choice: Obeying the Laws.- Secrecy and Group Creation.- On the Reachability Problem in Cryptographic Protocols.- Secure Information Flow for Concurrent Processes.- LP Deadlock Checking Using Partial Order Dependencies.- Pomsets for Local Trace Languages.- Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs.- The Control of Synchronous Systems.- Typing Non-uniform Concurrent Objects.- An Implicitly-Typed Deadlock-Free Process Calculus.- Typed Mobile Objects.- Synthesizing Distributed Finite-State Systems from MSCs.- Emptiness Is Decidable for Asynchronous Cellular Machines.- Revisiting Safety and Liveness in the Context of Failures.- Well-Abstracted Transition Systems.- A Unifying Approach to Data-Independence.- Chi Calculus with Mismatch.