CONCUR 2010 - Concurrency Theory - neues Buch

EAN (ISBN-13): 9783642153754
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-04-19T00:12:28+02:00 (Vienna)
Detailseite zuletzt geändert am 2022-01-24T21:33:30+01:00 (Vienna)
ISBN/EAN: 9783642153754

ISBN - alternative Schreibweisen:
978-3-642-15375-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: concurrency

---

Daten vom Verlag:

Autor/in: Paul Gastin; Francois Laroussinie
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; CONCUR 2010 - Concurrency Theory - 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010, Proceedings
Verlag: Springer; Springer Berlin
600 Seiten
Erscheinungsjahr: 2010-08-21
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XIII, 600 p. 134 illus.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; Simulation; abstract machines; atomicity checki; biology-inspired systems; concurrency models; design; domain theoretic modelsi; learning; model checking; model logics; modeling; pervasive computing; process algebras; resource logicsq; verification; C; Software Engineering; Computer Science Logic and Foundations of Programming; Computer Communication Networks; Compilers and Interpreters; Computer and Information Systems Applications; Computer Science; Theoretische Informatik; Netzwerk-Hardware; Compiler und Übersetzer; Angewandte Informatik; BC

Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis.- Applications of Shellable Complexes to Distributed Computing.- Concurrency and Composition in a Stochastic World.- Taming Distributed Asynchronous Systems.- Trust in Anonymity Networks.- Learning I/O Automata.- Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification.- Information Flow in Interactive Systems.- From Multi to Single Stack Automata.- A Geometric Approach to the Problem of Unique Decomposition of Processes.- A Logic for True Concurrency.- A Theory of Design-by-Contract for Distributed Multiparty Interactions.- Bisimilarity of One-Counter Processes Is PSPACE-Complete.- Nash Equilibria for Reachability Objectives in Multi-player Timed Games.- Stochastic Real-Time Games with Qualitative Timed Automata Objectives.- Session Types as Intuitionistic Linear Propositions.- Session Types for Access and Information Flow Control.- Simulation Distances.- Mean-Payoff Automaton Expressions.- Obliging Games.- Multipebble Simulations for Alternating Automata.- Parameterized Verification of Ad Hoc Networks.- Termination in Impure Concurrent Languages.- Buffered Communication Analysis in Distributed Multiparty Sessions.- Efficient Bisimilarities from Second-Order Reaction Semantics for ?-Calculus.- On the Use of Non-deterministic Automata for Presburger Arithmetic.- Reasoning about Optimistic Concurrency Using a Program Logic for History.- Theory by Process.- On the Compositionality of Round Abstraction.- A Linear Account of Session Types in the Pi Calculus.- Generic Forward and Backward Simulations II: Probabilistic Simulation.- Kleene, Rabin, and Scott Are Available.- Reversing Higher-Order Pi.- Modal Logic over Higher Dimensional Automata.- A Communication Based Model for Games ofImperfect Information.- Flat Coalgebraic Fixed Point Logics.- Conditional Automata: A Tool for Safe Removal of Negligible Events.- Representations of Petri Net Interactions.- Communicating Transactions.- Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations.
Up to date results Fast conference proceedings State-of-the-art report