CONCUR 2000 - concurrency theory : 11th international conference, University Park, PA, USA, August 22-25, 2000 : proceedings
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...
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
1877 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Concur 2000, concurrency theory, 11th international conference, University Park, PA, USA, August 22-25, 2000, proceedings, Catuscia Palamidessi (ed.), 2000, Berlin, Springer, 1 vol. (XI-612 p.), Lecture notes in computer science, 3-540-67897-2 • CONCUR 2000 - Concurrency Theory, Texte imprimé, 9783662209783 |
جدول المحتويات:
- 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
- TypingNon-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.