Reachability Problems
14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings
(Sprache: Englisch)
This book constitutes the refereed proceedings of the 14th International Conference on Reachability Problems, RP 2020, held in Paris, France in October 2020.
The 8 full papers presented were carefully reviewed and selected from 25 submissions. In...
The 8 full papers presented were carefully reviewed and selected from 25 submissions. In...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
Fr. 59.00
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Reachability Problems “
Klappentext zu „Reachability Problems “
This book constitutes the refereed proceedings of the 14th International Conference on Reachability Problems, RP 2020, held in Paris, France in October 2020.The 8 full papers presented were carefully reviewed and selected from 25 submissions. In addition, 2 invited papers were included in this volume. The papers 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.
Inhaltsverzeichnis zu „Reachability Problems “
Invited Papers.- On decision problems for substitutions in symbolic dynamics.- Games with Full, Longitudinal, and Transverse Observability.- Regular Papers.- Reachability set generation using hybrid relation compatible saturation.- Case Study: Reachability Analysis of a unified Combat-Command-and-Control Model.- Qualitative Multi-Objective Reachability for Ordered Branching MDPs.- Quantum-over-classical Advantage in Solving Multiplayer Games.- Efficient Restrictions of Immediate Observation Petri Nets.- Binary expression of ancestors in the Collatz graph.- The Collatz process embeds a base conversion algorithm.- The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets.
Bibliographische Angaben
- 2020, 1st ed. 2020, XXI, 165 Seiten, 13 farbige Abbildungen, Masse: 15,6 x 23,6 cm, Kartoniert (TB), Englisch
- Herausgegeben: Sylvain Schmitz, Igor Potapov
- Verlag: Springer, Berlin
- ISBN-10: 3030617386
- ISBN-13: 9783030617387
Sprache:
Englisch
Kommentar zu "Reachability Problems"
0 Gebrauchte Artikel zu „Reachability Problems“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Reachability Problems".
Kommentar verfassen