TY  - BOOK
AU  - Gastin,Paul
AU  - Laroussinie,François
ED  - International Conference on Concurrency Theory
TI  - CONCUR 2010--concurrency theory: 21st international conference, CONCUR 2010, Paris, France, August 21-September 3, 2010 : proceedings 
T2  - Lecture notes in computer science,
SN  - 9783642153754
AV  - QA76.58 
U1  - 004/.35 22
PY  - 2010///
CY  - Berlin
PB  - Springer
KW  - Parallel processing (Electronic computers)
KW  - Congresses
KW  - Computer multitasking
KW  - Computing Methodologies
KW  - Parallélisme (Informatique)
KW  - Congrès
KW  - Fonctionnement multitâche
KW  - Informatique
KW  - eclas
KW  - fast
KW  - informatiesystemen
KW  - information systems
KW  - internet
KW  - computerwetenschappen
KW  - computer sciences
KW  - software engineering
KW  - computernetwerken
KW  - computer networks
KW  - programmeertalen
KW  - programming languages
KW  - kunstmatige intelligentie
KW  - artificial intelligence
KW  - Information and Communication Technology (General)
KW  - Informatie- en communicatietechnologie (algemeen)
KW  - Congress
KW  - proceedings (reports)
KW  - aat
KW  - Conference papers and proceedings
KW  - lcgft
KW  - Actes de congrès
KW  - rvmgf
N1  - Title from PDF title page (SpringerLink, viewed Aug. 24, 2010); Includes bibliographical references and index; 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 Transactions -- Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations
N2  - 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
UR  - https://link.springer.com/10.1007/978-3-642-15375-4
ER  -