Foundations of Software Science and Computation Structures
Editat de Anca Muschollen Limba Engleză Paperback – 18 mar 2014
Preț: 331.16 lei
Preț vechi: 413.95 lei
-20%
Puncte Express: 497
Carte tipărită la comandă
Livrare economică 11-25 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783642548291
ISBN-10: 3642548296
Pagini: 476
Ilustrații: XVI, 457 p. 48 illus.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.72 kg
Ediția:2014
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642548296
Pagini: 476
Ilustrații: XVI, 457 p. 48 illus.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.72 kg
Ediția:2014
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Equivalences of Pushdown Systems Are Hard.- Active Diagnosis for Probabilistic Systems.- Analysis of Probabilistic Basic Parallel Processes.- Limit Synchronization in Markov Decision Processes.- Maximal Cost-Bounded Reachability Probability on Continuous-Time.- Markov Decision Processes.- Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types.- A Semantical and Operational Account of Call-by-Value Solvability.- Network-Formation Games with Regular Objectives.- Playing with Probabilities in Reconfigurable Broadcast Networks.- Unsafe Order-2 Tree Languages Are Context-Sensitive.- Game Semantics for Nominal Exceptions.- Complexity of Model-Checking Call-by-Value Programs.- Resource Reachability Games on Pushdown Graphs.- Perfect-Information Stochastic Mean-Payoff Parity Games.- Latticed-LTL Synthesis in the Presence of Noisy Inputs.- The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.- On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations.- On Asymmetric Unification and the Combination Problem in Disjoint Theories.- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules.- Generalized Synchronization Trees.- Bisimulations for Communicating Transactions.- Upper-Expectation Bisimilarity and Lukasiewicz μ-Calculus.- Interacting Bialgebras Are Frobenius.- Generalized Eilenberg Theorem I: Local Varieties of Languages.- Combining Bialgebraic Semantics and Equations.- Models of a Non-associative Composition.- Foundations for Decision Problems in Separation Logic with General Inductive Predicates.- A Coalgebraic Approach to Linear-Time Logics.- A Relatively Complete Calculus for Structured Heterogeneous Specifications.