Theoretical Aspects of Computing ? ICTAC 2024 - Anutariya, Chutiporn; Bonsangue, Marcello M.; (ed.) - Prospero Internet Bookshop

 
Product details:

ISBN13:9783031770180
ISBN10:3031770188
Binding:Paperback
No. of pages:356 pages
Size:235x155 mm
Language:English
Illustrations: XII, 356 p.
700
Category:

Theoretical Aspects of Computing ? ICTAC 2024

21st International Colloquium, Bangkok, Thailand, November 25?29, 2024, Proceedings
 
Edition number: 2025
Publisher: Springer
Date of Publication:
Number of Volumes: 1 pieces, Book
 
Normal price:

Publisher's listprice:
EUR 79.17
Estimated price in HUF:
33 750 HUF (32 143 HUF + 5% VAT)
Why estimated?
 
Your price:

27 000 (25 714 HUF + 5% VAT )
discount is: 20% (approx 6 750 HUF off)
Discount is valid until: 31 December 2024
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
 
Availability:

Not yet published.
 
  Piece(s)

 
Long description:

This book constitutes the refereed proceedings of the 21st International Colloquium on Theoretical Aspects of Computing, ICTAC 2024, held in Bangkok, Thailand, during November 25?29, 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.

Table of Contents:

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 Ramsey?s theorem by symbolic computation over the finite field GF(2).- Runtime Enforcement with Event Reordering.