Cantitate/Preț
Produs

Reachability Problems: 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ț: 31644 lei

Preț vechi: 39555 lei
-20%

Puncte Express: 475

Carte tipărită la comandă

Livrare economică 08-22 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9783030617387
ISBN-10: 3030617386
Pagini: 188
Ilustrații: XXI, 165 p. 126 illus., 13 illus. in color.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.3 kg
Ediția:1st edition 2020
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

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.