Reachability Problems
15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings
(Sprache: Englisch)
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...
The 6 full papers presented were carefully reviewed and selected from 27 submissions. In...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
87.99 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Reachability Problems “
Klappentext zu „Reachability Problems “
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.
Inhaltsverzeichnis zu „Reachability Problems “
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.-
Bibliographische Angaben
- 2021, 1st ed. 2021, XVIII, 165 Seiten, 6 farbige Abbildungen, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Herausgegeben: Paul C. Bell, Patrick Totzke, Igor Potapov
- Verlag: Springer, Berlin
- ISBN-10: 303089715X
- ISBN-13: 9783030897154
Sprache:
Englisch
Kommentar zu "Reachability Problems"
Schreiben Sie einen Kommentar zu "Reachability Problems".
Kommentar verfassen