CONCUR 2005 - Concurrency Theory - Erstausgabe

EAN (ISBN-13): 9783540283096
ISBN (ISBN-10): 3540283099
Taschenbuch
Erscheinungsjahr: 2005
Herausgeber: Springer Berlin
600 Seiten
Gewicht: 0,894 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-27T06:40:34+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-11-10T09:42:48+01:00 (Zurich)
ISBN/EAN: 3540283099

ISBN - alternative Schreibweisen:
3-540-28309-9, 978-3-540-28309-6
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: alfaro, martin, abad, abadi, luca
Titel des Buches: theoretical computer science, concurrency, san francisco, third international theory, august lucas, usa, international conference proceedings, 2005

---

Daten vom Verlag:

Autor/in: Martín Abadi; Luca de Alfaro
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; CONCUR 2005 - Concurrency Theory - 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings
Verlag: Springer; Springer Berlin
1280 Seiten
Erscheinungsjahr: 2005-08-08
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XXIV, 1280 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Systemanalyse und -design; Verstehen; Informatik; algorithm; algorithms; concurrency; distributed programming; logic; logic programming; model checking; petri net; programming; real-time; semantics; verification; Computer System Implementation; Theory of Computation; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Programming Techniques; Theoretische Informatik; Compiler und Übersetzer; Computerprogrammierung und Softwareentwicklung; EA

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.