Cantitate/Preț
Produs

Reachability Problems: 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings: Lecture Notes in Computer Science, cartea 13035

Editat de Paul C. Bell, Patrick Totzke, Igor Potapov
en Limba Engleză Paperback – 26 oct 2021
This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2021, held in Liverpool, UK in October 2021.
The 6 full papers presented were carefully reviewed and selected from 27 submissions. In addition, 4 invited papers were included in this volume. The RP proceedings cover topics such as reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps; and new computational paradigms.
Chapter ‘Recent Advances on Reachability Problems for Valence Systems’ is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 52632 lei

Preț vechi: 65791 lei
-20% Nou

Puncte Express: 789

Preț estimativ în valută:
10072 10452$ 8419£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030897154
ISBN-10: 303089715X
Pagini: 165
Ilustrații: XVIII, 165 p. 16 illus., 6 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.27 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Invited Papers.- Quantitative vs. Weighted Automata.- Theorem Proving Using Clausal Resolution: From Past to Present.- Population Protocols: Beyond Runtime Analysis.- Recent Advances on Reachability Problems for Valence Systems (Invited Talk).- Regular Papers.- Improvements in Unfolding of Colored Petri Nets.- Reachability of weakly nonlinear systems using Carleman linearization.- Continued Fraction approach to Gauss-Reduction theory.- Absent Subsequences in Words.- Minimal Number of Calls in Propositional Protocols.- Reachability Is NP-Complete Even for the Simplest Neural Networks.-

Textul de pe ultima copertă

Chapter ‘Recent Advances on Reachability Problems for Valence Systems’ is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.