CONCUR 2005 - Concurrency Theory
Editat de Martín Abadi, Luca De Alfaroen Limba Engleză Paperback – 8 aug 2005
Preț: 351.00 lei
Preț vechi: 438.75 lei
-20%
Puncte Express: 527
Carte tipărită la comandă
Livrare economică 06-20 octombrie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540283096
ISBN-10: 3540283099
Pagini: 600
Ilustrații: XXIV, 1280 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.9 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540283099
Pagini: 600
Ilustrații: XXIV, 1280 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.9 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Lectures.- Static Analysis Versus Model Checking for Bug Finding.- The Benefits of Exposing Calls and Returns.- A Compositional Approach to the Stochastic Dynamics of Gene Networks.- Contributed Papers.- Games Other People Play.- Type-Directed Concurrency.- Multiport Interaction Nets and Concurrency.- Model Checking for ?-Calculus Using Proof Search.- A Game Semantics of the Asynchronous ?-Calculus.- Efficient On-the-Fly Algorithms for the Analysis of Timed Games.- Modal Logics for Timed Control.- Timed Shuffle Expressions.- A New Modality for Almost Everywhere Properties in Timed Automata.- The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation.- A Behavioural Pseudometric for Metric Labelled Transition Systems.- On Probabilistic Program Equivalence and Refinement.- Probabilistic Anonymity.- Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus.- Timed Spi-Calculus with Types for Secrecy and Authenticity.- Selecting Theories and Recursive Protocols.- Constraint Solving for Contract-Signing Protocols.- A Ground-Complete Axiomatization of Finite State Processes in Process Algebra.- Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP.- Bisimulations Up-to for the Linear Time Branching Time Spectrum.- Deriving Weak Bisimulation Congruences from Reduction Systems.- SOS for Higher Order Processes.- The Individual and Collective Token Interpretations of Petri Nets.- Merged Processes — A New Condensed Representation of Petri Net Behaviour.- Concurrent Clustered Programming.- A Theory of System Behaviour in the Presence of Node and Link Failures.- Comparing Two Approaches to Compensable Flow Composition.- Transactions in RCCS.- Two-Player Nonzero-Sum ?-Regular Games.- Games Where You Can PlayOptimally Without Any Memory.- On Implementation of Global Concurrent Systems with Local Asynchronous Controllers.- Defining Fairness.- Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems.- Termination Analysis of Integer Linear Loops.- A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs.- Verification of Qualitative ? Constraints.- Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces.- Taming Interface Specifications.- Synthesis of Distributed Systems from Knowledge-Based Specifications.