Cantitate/Preț
Produs
Total produse
Vezi coșul
Foundations of Software Science and Computation Structures de Naoki Kobayashi

Foundations of Software Science and Computation Structures: Lecture Notes in Computer Science, cartea 14574

Editat de Naoki Kobayashi, James Worrell
en Limba Engleză Paperback – 5 apr 2024
The two open access volumes LNCS 14574 and 14575 constitute the proceedings of the 27th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2024, which took place in Luxembourg in April 2024.

The 24 full papers included in this book were carefully reviewed and selected from 79 submissions. They were organized in topical sections as follows: 

Part I: Infinite games; categorical semantics; automata and synthesis; 
Part II: Types and programming languages; logic and proofs; infinite-state systems.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 29413 lei  22-36 zile
  Springer – 6 apr 2024 29413 lei  22-36 zile
  Springer – 5 apr 2024 29452 lei  43-57 zile

Din seria Lecture Notes in Computer Science

Preț: 29452 lei

Preț vechi: 36814 lei
-20%

Puncte Express: 442
Preț estimativ în valută:
5208€ • 6018$ • 4499£

Carte tipărită la comandă

Livrare economică 04-18 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783031572272
ISBN-10: 3031572270
Pagini: 296
Ilustrații: XVI, 280 p. 44 illus., 24 illus. in color.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2024
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Invited Talk.- Ackermannian Completion of Separators.- Infinite Games.- Fair Omega-regular Games.- Stochastic Window Mean-Payoff Games.- Symbolic Solution of Emerson-Lei Games for Reactive Synthesis.- Parity Games on Temporal Graphs.- Categorical Semantics.- Drawing from an Urn is Isometric.- Enriching Diagrams with Algebraic Operations.- Monoidal Extended Stone Duality.- Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory).- Automata and Synthesis.- Determinization of Integral Discounted-Sum Automata is Decidable.- Checking History-Determinism is NP-hard for Parity Automata.- Tighter Construction of Tight Büchi Automata.- Synthesis with Privacy Against an Observer.

Textul de pe ultima copertă

The two open access volumes LNCS 14574 and 14575 constitute the proceedings of the 27th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2024, which took place in Luxembourg in April 2024.

The 24 full papers included in this book were carefully reviewed and selected from 79 submissions. They were organized in topical sections as follows: 

Part I: Infinite games; categorical semantics; automata and synthesis; 
Part II: Types and programming languages; logic and proofs; infinite-state systems.

Caracteristici

This book is open access, which means that you have free and unlimited access