Verkauf durch Sack Fachmedien

Schmitz / Potapov

Reachability Problems

14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings

Medium: Buch
ISBN: 978-3-030-61738-7
Verlag: Springer
Erscheinungstermin: 13.10.2020
Lieferfrist: bis zu 10 Tage

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.


Produkteigenschaften


  • Artikelnummer: 9783030617387
  • Medium: Buch
  • ISBN: 978-3-030-61738-7
  • Verlag: Springer
  • Erscheinungstermin: 13.10.2020
  • Sprache(n): Englisch
  • Auflage: 1. Auflage 2020
  • Serie: Theoretical Computer Science and General Issues
  • 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 .- 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.