Verkauf durch Sack Fachmedien

Bell / Totzke / Potapov

Reachability Problems

15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings

Medium: Buch
ISBN: 978-3-030-89715-4
Verlag: Springer
Erscheinungstermin: 26.10.2021
Lieferfrist: bis zu 10 Tage

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.


Produkteigenschaften


  • Artikelnummer: 9783030897154
  • Medium: Buch
  • ISBN: 978-3-030-89715-4
  • Verlag: Springer
  • Erscheinungstermin: 26.10.2021
  • Sprache(n): Englisch
  • Auflage: 1. Auflage 2021
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert, Paperback
  • Gewicht: 295 g
  • Seiten: 165
  • Format (B x H x T): 155 x 235 x 11 mm
  • Ausgabetyp: Kein, Unbekannt
Autoren/Hrsg.

Herausgeber

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