Cantitate/Preț
Produs

Reachability Problems: 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings: Lecture Notes in Computer Science, cartea 10506

Editat de Matthew Hague, Igor Potapov
en Limba Engleză Paperback – 25 aug 2017
This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions.

The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining 
mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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ț: 32827 lei

Preț vechi: 41034 lei
-20% Nou

Puncte Express: 492

Preț estimativ în valută:
6283 6534$ 5257£

Carte tipărită la comandă

Livrare economică 14-28 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319670881
ISBN-10: 3319670883
Pagini: 193
Ilustrații: XV, 193 p. 34 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.3 kg
Ediția:1st ed. 2017
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

Reachability problems in infinite state systems.- rewriting systems.- dynamical and hybrid systems.- reachability problems in logic and verification.- eachability analysis in different computational models.-  Petri-Nets.- Computational aspects of algebraic structures.

Caracteristici

Includes supplementary material: sn.pub/extras