000 04302nam a22005655i 4500
001 978-3-642-15375-4
003 DE-He213
005 20160624102147.0
007 cr nn 008mamaa
008 100820s2010 gw | s |||| 0|eng d
020 _a9783642153754
_9978-3-642-15375-4
024 7 _a10.1007/978-3-642-15375-4
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aCONCUR 2010 - Concurrency Theory
_h[electronic resource] :
_b21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings /
_cedited by Paul Gastin, François Laroussinie.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXIII, 600p. 134 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6269
505 0 _aDating 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.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 0 _aInformation systems.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aSoftware Engineering.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aComputer Communication Networks.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aInformation Systems Applications (incl.Internet).
650 2 4 _aArtificial Intelligence (incl. Robotics).
700 1 _aGastin, Paul.
_eeditor.
700 1 _aLaroussinie, François.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642153747
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6269
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-15375-4
942 _2EBK9244
_cEBK
999 _c38538
_d38538