CONCUR 2000 - Concurrency Theory: 11th International Conference, University Park, PA, USA, August 22-25, 2000 Proceedings: Lecture Notes in Computer Science, cartea 1877
Editat de Catuscia Palamidessien Limba Engleză Paperback – 11 aug 2000
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 661.97 lei
Preț vechi: 827.46 lei
-20% Nou
Puncte Express: 993
Preț estimativ în valută:
126.68€ • 131.46$ • 105.88£
126.68€ • 131.46$ • 105.88£
Carte tipărită la comandă
Livrare economică 17-31 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540678977
ISBN-10: 3540678972
Pagini: 632
Ilustrații: XI, 613 p.
Dimensiuni: 155 x 233 x 33 mm
Greutate: 0.87 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540678972
Pagini: 632
Ilustrații: XI, 613 p.
Dimensiuni: 155 x 233 x 33 mm
Greutate: 0.87 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras