Foundations of Software Science and Computational Structures
Editat de Vladimiro Sassoneen Limba Engleză Paperback – 24 mar 2005
Preț: 334.47 lei
Preț vechi: 418.08 lei
-20%
Puncte Express: 502
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: 9783540253884
ISBN-10: 3540253882
Pagini: 540
Ilustrații: XIV, 530 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.81 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540253882
Pagini: 540
Ilustrații: XIV, 530 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.81 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks.- Model Checking for Nominal Calculi.- Mathematical Models of Computational and Combinatorial Structures.- Rule Formats and Bisimulation.- Congruence for Structural Congruences.- Probabilistic Congruence for Semistochastic Generative Processes.- Bisimulation on Speed: A Unified Approach.- Probabilistic Models.- Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications.- Axiomatizations for Probabilistic Finite-State Behaviors.- Stochastic Transition Systems for Continuous State Spaces and Non-determinism.- Model Checking Durational Probabilistic Systems.- Algebraic Models.- Free-Algebra Models for the ?-Calculus.- A Unifying Model of Variables and Names.- A Category of Higher-Dimensional Automata.- Games and Automata.- Third-Order Idealized Algol with Iteration Is Decidable.- Fault Diagnosis Using Timed Automata.- Optimal Conditional Reachability for Multi-priced Timed Automata.- Alternating Timed Automata.- Language Analysis.- Full Abstraction for Polymorphic Pi-Calculus.- Foundations of Web Transactions.- Bridging Language-Based and Process Calculi Security.- History-Based Access Control with Local Policies.- Partial Order Models.- Composition and Decomposition in True-Concurrency.- Component Refinement and CSC Solving for STG Decomposition.- The Complexity of Live Sequence Charts.- Logics.- A Simpler Proof Theory for Nominal Logic.- From Separation Logic to First-Order Logic.- Justifying Algorithms for ??-Conversion.- On Decidability Within the Arithmetic of Addition and Divisibility.- Coalgebraic Modal Logics.- Expressivity of Coalgebraic Modal Logic: The Limits and Beyond.- Duality for Logics of Transition Systems.- Computational Models.- Confluence of Right Ground Term Rewriting Systems Is Decidable.- Safety Is nota Restriction at Level 2 for String Languages.- A Computational Model for Multi-variable Differential Calculus.