Muutke küpsiste eelistusi

Theoretical Aspects of Computing ICTAC 2024: 21st International Colloquium, Bangkok, Thailand, November 2529, 2024, Proceedings 2025 ed. [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 410 pages, kõrgus x laius: 235x155 mm, 24 Illustrations, color; 48 Illustrations, black and white; XVIII, 410 p. 72 illus., 24 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15373
  • Ilmumisaeg: 22-Nov-2024
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031770188
  • ISBN-13: 9783031770180
Teised raamatud teemal:
  • Pehme köide
  • Hind: 63,52 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 74,73 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Theoretical Aspects of Computing ICTAC 2024: 21st International Colloquium, Bangkok, Thailand, November 2529, 2024, Proceedings 2025 ed.Suurem pilt
  • Formaat: Paperback / softback, 410 pages, kõrgus x laius: 235x155 mm, 24 Illustrations, color; 48 Illustrations, black and white; XVIII, 410 p. 72 illus., 24 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15373
  • Ilmumisaeg: 22-Nov-2024
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031770188
  • ISBN-13: 9783031770180
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031770180.html
Märksõnad:
This book constitutes the refereed proceedings of the 21st International Colloquium on Theoretical Aspects of Computing, ICTAC 2024, held in Bangkok, Thailand, during November 2529, 2024. 





The 21 full papers presented here were carefully reviewed and selected from 46 submissions. They were categorized into the following topical sections: Invited Papers; Automata, Languages, and Learning; Algorithms and Complexity; Graphs and Games; Process Calculi; Verification and Reasoning.
Automata, Languages, and Learning.- Well Behaved (Co)algebraic Semantics
of Regular Expressions in Dafny.- Jump Complexity of Deterministic Finite
Automata with Translucent Letters.- Learning Closed Signal Flow Graphs.- Dual
Adjunction Between $Omega$ Automata and Wilke Algebra Quotients.- On
Concurrent Program Algebra and Demonic Automata.- Bisimulations and Logics
for Higher Dimensional Automata.- Algorithms and Complexity.- Maximizing
Weighted Dominance in the Plane.- Generalized Parikh Matrices For Tracking
Subsequence Occurrences.- Card Based Protocols with Single Card Encoding.-
Graphs and Games.- Winning Strategy Templates for Stochastic Parity Games
towards Permissive and Resilient Control.- Disconnection Rules are Complete
for Chemical Reactions.- Verification with Common Knowledge of Rationality
for Graph Games.- Process Calculi.- Reversibility in Process Calculi with
Nondeterminism and Probabilities.- A Theory of Proc Omata and a Proof
Technique for Parameterized Process Architectures.- Formal Foundations for
Efficient Simulation of MOM Systems The Refinement Calculus for Object
Oriented Event Graphs.- Verification and Reasoning.- Verifying Type Safety
for Isabelle/Solidity.- History Based Reasoning about Behavioral Subtyping.-
Switched Systems in Coq for Modeling Periodic Controllers.-  A quantum
inspired mechanical method for proving of Ramseys theorem by symbolic
computation over the finite field GF(2).- Runtime Enforcement with Event
Reordering.