Cantitate/Preț
Produs

Reachability Problems: 14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12448

Editat de Sylvain Schmitz, Igor Potapov
en Limba Engleză Paperback – 13 oct 2020
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32471 lei

Preț vechi: 40589 lei
-20% Nou

Puncte Express: 487

Preț estimativ în valută:
6218 6407$ 5218£

Carte tipărită la comandă

Livrare economică 22 februarie-08 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030617387
ISBN-10: 3030617386
Pagini: 165
Ilustrații: XXI, 165 p. 126 illus., 13 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.27 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.