{"text_format":"5","workbook":"xls","n_sheets":1,"sheets":["report2"],"props":{"last_modified_by":"sharecat"},"not_rendered":{"external_links":1,"defined_names":1},"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[17,2,17,3],[18,2,18,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996202528103316"]
[null,null,"Titolo",null,"CONCUR 2014 – Concurrency Theory [[electronic resource] ] : 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014"]
[null,null,"ISBN",null,"3-662-44584-0"]
[null,null,"Edizione",null,"[1st ed. 2014.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XXII, 594 p. 90 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 8704"]
[null,null,"Disciplina",null,"004.35"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Mathematical statistics"]
[{"$nulls":4},"Machine theory"]
[{"$nulls":4},"Computer Science Logic and Foundations of Programming"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Probability and Statistics in Computer Science"]
[{"$nulls":4},"Formal Languages and Automata Theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[{"$nulls":3},"Livello bibliografico","Monografia"]
[{"$nulls":3},"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Laws 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 -- "]
[{"$nulls":4},"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."]
[{"$nulls":3},"Sommario/riassunto","This 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."]