Cantitate/Preț
Produs

Reachability Problems: 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ț: 50845 lei

Preț vechi: 63556 lei
-20%

Puncte Express: 763

Carte tipărită la comandă

Livrare economică 27 iulie-10 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs 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: 9783030897154
ISBN-10: 303089715X
Pagini: 188
Ilustrații: XVIII, 165 p. 16 illus., 6 illus. in color.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.3 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

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.