Vor Ort
Merkzettel Warenkorb
  • Produktbild: CONCUR 2008 - Concurrency Theory
  • Produktbild: CONCUR 2008 - Concurrency Theory
Band 5201

CONCUR 2008 - Concurrency Theory 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.07.2008

Abbildungen

XIII, 524 p.

Herausgeber

Franck van Breugel + weitere

Verlag

Springer Berlin

Seitenzahl

524

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

809 g

Auflage

2008

Sprache

Englisch

ISBN

978-3-540-85360-2

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.07.2008

Abbildungen

XIII, 524 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

524

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

809 g

Auflage

2008

Sprache

Englisch

ISBN

978-3-540-85360-2

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: CONCUR 2008 - Concurrency Theory
  • Produktbild: CONCUR 2008 - Concurrency Theory
  • Invited Papers.- Beyond Nash Equilibrium: Solution Concepts for the 21st Century.- Service Choreography and Orchestration with Conversations.- Knowledge and Information in Probabilistic Systems.- Taming Concurrency: A Program Verification Perspective.- Contributed Papers.- A Model of Dynamic Separation for Transactional Memory.- Completeness and Nondeterminism in Model Checking Transactional Memories.- Semantics of Deterministic Shared-Memory Systems.- A Scalable and Oblivious Atomicity Assertion.- R-Automata.- Distributed Timed Automata with Independently Evolving Clocks.- A Context-Free Process as a Pushdown Automaton.- Modeling Computational Security in Long-Lived Systems.- Contract-Directed Synthesis of Simple Orchestrators.- Environment Assumptions for Synthesis.- Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning.- SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs.- Subsequence Invariants.- Invariants for Parameterised Boolean Equation Systems.- Unfolding-Based Diagnosis of Systems with an Evolving Topology.- On the Construction of Sorted Reactive Systems.- Dynamic Partial Order Reduction Using Probe Sets.- A Space-Efficient Probabilistic Simulation Algorithm.- Least Upper Bounds for Probability Measures and Their Applications to Abstractions.- Abstraction for Stochastic Systems by Erlang’s Method of Stages.- On the Minimisation of Acyclic Models.- Quasi-Static Scheduling of Communicating Tasks.- Strategy Construction for Parity Games with Imperfect Information.- Mixing Lossy and Perfect Fifo Channels.- On the Reachability Analysis of Acyclic Networks of Pushdown Systems.- Spatial and Behavioral Types in the Pi-Calculus.- A Spatial Equational Logic for the Applied ?-Calculus.- Structured Interactional Exceptions inSession Types.- Global Progress in Dynamically Interleaved Multiparty Sessions.- Normed BPA vs. Normed BPP Revisited.- A Rule Format for Associativity.- Deriving Structural Labelled Transitions for Mobile Ambients.- Termination Problems in Chemical Kinetics.- Towards a Unified Approach to Encodability and Separation Results for Process Calculi.- A Notion of Glue Expressiveness for Component-Based Systems.