Cantitate/Preț
Produs

Foundations of Software Science and Computational Structures: 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008, Proceedings: Lecture Notes in Computer Science, cartea 4962

Editat de Roberto Amadio
en Limba Engleză Paperback – 18 mar 2008

Din seria Lecture Notes in Computer Science

Preț: 33292 lei

Preț vechi: 41615 lei
-20%

Puncte Express: 499

Carte tipărită la comandă

Livrare economică 10-24 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 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: 9783540784975
ISBN-10: 3540784977
Pagini: 526
Ilustrații: XV, 508 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.79 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Finding Your Way in a Forest: On Different Types of Trees and Their Properties.- Simple Stochastic Games with Few Random Vertices Are Easy to Solve.- The Complexity of Nash Equilibria in Infinite Multiplayer Games.- Stochastic Games with Lossy Channels.- Simulation Hemi-metrics between Infinite-State Stochastic Games.- Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics.- A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract).- The ?-Regular Post Embedding Problem.- Complexity of Decision Problems for Mixed and Modal Specifications.- Classes of Tree Homomorphisms with Decidable Preservation of Regularity.- A Kleene-Schützenberger Theorem for Weighted Timed Automata.- Robust Analysis of Timed Automata Via Channel Machines.- The Common Fragment of ACTL and LTL.- The Complexity of CTL* + Linear Past.- Footprints in Local Reasoning.- A Modal Deconstruction of Access Control Logics.- Coalgebraic Logic and Synthesis of Mealy Machines.- The Microcosm Principle and Concurrency in Coalgebra.- Systems of Equations Satisfied in All Commutative Finite Semigroups.- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity.- On Decision Problems for Probabilistic Büchi Automata.- Model-Checking ?-Regular Properties of Interval Markov Chains.- Prevision Domains and Convex Powercones.- RPO, Second-Order Contexts, and ?-Calculus.- Erasure and Polymorphism in Pure Type Systems.- The Implicit Calculus of Constructions as a Programming Language with Dependent Types.- Strong Normalisation of Cut-Elimination That Simulates ?-Reduction.- Symbolic Semantics Revisited.- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions.- Structural Operational Semantics for StochasticProcess Calculi.- Compositional Methods for Information-Hiding.- Products of Message Sequence Charts.- What Else Is Decidable about Integer Arrays?.- Model Checking Freeze LTL over One-Counter Automata.