Willkommen, schön sind Sie da!
Logo Ex Libris

Reachability Problems

  • E-Book (pdf)
  • 165 Seiten
(0) Erste Bewertung abgeben
Alle Bewertungen ansehen
This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2021, held in Li... Weiterlesen
CHF 94.90
Download steht sofort bereit
Informationen zu E-Books
E-Books eignen sich auch für mobile Geräte (sehen Sie dazu die Anleitungen).
E-Books von Ex Libris sind mit Adobe DRM kopiergeschützt: Erfahren Sie mehr.
Weitere Informationen finden Sie hier.
Bestellung & Lieferung in eine Filiale möglich


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


Titel: Reachability Problems
Untertitel: 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings
EAN: 9783030897161
Format: E-Book (pdf)
Hersteller: Springer International Publishing
Genre: IT & Internet
Veröffentlichung: 26.11.2021
Digitaler Kopierschutz: Wasserzeichen
Anzahl Seiten: 165

Weitere Bände aus der Buchreihe "Lecture Notes in Computer Science"

Band 13035
Sie sind hier.