CONCUR 2010 - Concurrency Theory
21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010, Proceedings
(Sprache: Englisch)
This book constitutes the refereed proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2010, held in Paris, France, August 31 - September 3, 2010. The 35 revised full papers were carefully reviewed and selected from 107...
Leider schon ausverkauft
versandkostenfrei
Buch (Kartoniert)
Fr. 168.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „CONCUR 2010 - Concurrency Theory “
This book constitutes the refereed proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2010, held in Paris, France, August 31 - September 3, 2010. The 35 revised full papers were carefully reviewed and selected from 107 submissions. The topics include: - Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets. - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics. - Models of specialized systems such as biology-inspired systems, circuits, hybrid systems, mobile and collaborative systems, multi-core processors, probabilistic systems, real-time systems, service-oriented computing, and synchronous systems. - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking and run-time verification.
Klappentext zu „CONCUR 2010 - Concurrency Theory “
This book constitutes the refereed proceedigs of the 20th International Conference on Concurrency Theory, CONCUR 2010, held in Paris, France, August 31 - September 3, 2010.The 35 revised full papers were carefully reviewed and selected from 107 submissions. The topics include:
- Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets. - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics. - Models of specialized systems such as biology-inspired systems, circuits, hybrid systems, mobile and collaborative systems, multi-core processors, probabilistic systems, real-time systems, service-oriented computing, and synchronous systems.
- Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking and run-time verification.
Inhaltsverzeichnis zu „CONCUR 2010 - Concurrency Theory “
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 of Imperfect Information.- Flat Coalgebraic Fixed Point Logics.- Conditional Automata: A Tool for Safe Removal of Negligible Events.- Representations of Petri Net Interactions.- Communicating
... mehr
Transactions.- Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations.
... weniger
Bibliographische Angaben
- 2010, 600 Seiten, Masse: 15,8 x 24,3 cm, Kartoniert (TB), Englisch
- Eds.: Gastin, Paul; Laroussinie, Francois
- Herausgegeben: Paul Gastin, Francois Laroussinie
- Verlag: Springer
- ISBN-10: 3642153747
- ISBN-13: 9783642153747
- Erscheinungsdatum: 18.08.2010
Sprache:
Englisch
Kommentar zu "CONCUR 2010 - Concurrency Theory"
0 Gebrauchte Artikel zu „CONCUR 2010 - Concurrency Theory“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "CONCUR 2010 - Concurrency Theory".
Kommentar verfassen