000 05097nam a22005775i 4500
001 978-3-662-44584-6
003 DE-He213
005 20240730194334.0
007 cr nn 008mamaa
008 140823s2014 gw | s |||| 0|eng d
020 _a9783662445846
_9978-3-662-44584-6
024 7 _a10.1007/978-3-662-44584-6
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCONCUR 2014 - Concurrency Theory
_h[electronic resource] :
_b25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings.
250 _a1st ed. 2014.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2014.
300 _aXXII, 594 p. 90 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8704
505 0 _aLaws of Programming: The Algebraic Unification of Theories of Concurrency -- The Benefits of Sometimes Not Being Discrete -- Deterministic Negotiations: Concurrency for Free -- Generalized Bisimulation Metrics -- Choreographies, Logically -- Deadlock Analysis of Unbounded Process Networks -- Trees from Functions as Processes -- Bisimulations Up-to: Beyond First-Order Transition Systems -- Parameterized Model Checking of Rendezvous Systems -- On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability -- Lost in Abstraction: Monotonicity in Multi-threaded Programs -- Synthesis from Component Libraries with Costs -- Compositional Controller Synthesis for Stochastic Games -- Synchronizing Strategies under Partial Observability -- Probabilistic Robust Timed Games -- Perturbation Analysis in Verification of Discrete-Time Markov Chains -- Robust Synchronization in Markov Decision Processes -- Probabilistic Bisimulation: Naturally on Distributions -- Averaging in LTL -- Decidable Topologies for Communicating Automata with FIFO and Bag Channels -- Controllers for the Verification of Communicating Multi-pushdown Systems -- Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking -- A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups -- A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm -- Bounds on Mobility -- Typing Messages for Free in Security Protocols: The Case of Equivalence Properties -- Using Higher-Order Contracts to Model Session Types (Extended Abstract) -- A Semantic Deconstruction of Session Types -- Timed Multiparty Session Types -- A Categorical Semantics of Signal Flow Graphs -- Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices -- A General Framework for Well-Structured Graph Transformation Systems -- (Un)decidable Problems about Reachability of Quantum Systems -- Ordered Navigation on Multi-attributed Data Words.-Verification for Timed Automata Extended with Unbounded Discrete Data Structures -- Reducing Clocks in Timed Automata while Preserving Bisimulation -- Qualitative Concurrent Parity Games: Bounded Rationality -- Adding Negative Prices to Priced Timed Games -- Tight Game Abstractions of Probabilistic Automata.
520 _aThis book constitutes the refereed proceedings of the 25th International Conference on Concurrency Theory, CONCUR 2014, held in Rome, Italy in September 2014. The 35 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 124 submissions. The focus of the conference is on the following topics: process calculi, model checking and abstraction, synthesis, quantitative models, automata and multithreading, complexity, process calculi and types, categories, graphs and quantum systems, automata and time, and games.
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aMathematical statistics.
_99597
650 0 _aMachine theory.
_9156669
650 1 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aProbability and Statistics in Computer Science.
_931857
650 2 4 _aFormal Languages and Automata Theory.
_9156670
700 1 _aBaldan, Paolo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156671
710 2 _aSpringerLink (Online service)
_9156672
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662445839
776 0 8 _iPrinted edition:
_z9783662445853
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8704
_9156673
856 4 0 _uhttps://doi.org/10.1007/978-3-662-44584-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95146
_d95146