Reachability Problems

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

AvSylvain Schmitz,Igor Potapov

Häftad, Engelska, 2020

Del 12448 i serien Lecture Notes in Computer Science

565 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2020-10-13
Mått:155 x 235 x 11 mm
Vikt:295 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:165
Förlag:Springer Nature Switzerland AG
ISBN:9783030617387

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Hårdvara inom Data och IT

Innehållsförteckning

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.