Muutke küpsiste eelistusi

Reachability Problems: 15th International Conference, RP 2021, Liverpool, UK, October 2527, 2021, Proceedings 1st ed. 2021 [Pehme köide]

Edited by , Edited by , Edited by
  • Formaat: Paperback / softback, 165 pages, kõrgus x laius: 235x155 mm, kaal: 296 g, 6 Illustrations, color; 10 Illustrations, black and white; XVIII, 165 p. 16 illus., 6 illus. in color., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 13035
  • Ilmumisaeg: 26-Oct-2021
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 303089715X
  • ISBN-13: 9783030897154
Teised raamatud teemal:
  • Pehme köide
  • Hind: 76,49 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 89,99 €
  • 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
Reachability Problems: 15th International Conference, RP 2021, Liverpool, UK, October 2527, 2021, Proceedings 1st ed. 2021Suurem pilt
  • Formaat: Paperback / softback, 165 pages, kõrgus x laius: 235x155 mm, kaal: 296 g, 6 Illustrations, color; 10 Illustrations, black and white; XVIII, 165 p. 16 illus., 6 illus. in color., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 13035
  • Ilmumisaeg: 26-Oct-2021
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 303089715X
  • ISBN-13: 9783030897154
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783030897154.html
Märksõnad:
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.

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.-