CONCUR 2000 - Concurrency Theory 11th International Conference, University Park, PA, USA, August 22-25, 2000 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Palamidessi, Catuscia (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1877
• Θέματα: Architecture, Computer.; Programming languages (Electronic computers).; Computer logic.; Computers.; Computer programming.; Computer communication systems.; Computer System Implementation.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Computation by Abstract Devices.; Programming Techniques.; Computer Communication Networks.

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

Πίνακας περιεχομένων:

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