Cantitate/Preț
Produs
Total produse
Vezi coșul
Reachability Problems de Matthew Hague

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

Preț vechi: 39708 lei
-20%

Puncte Express: 476

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ă.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319670881
ISBN-10: 3319670883
Pagini: 212
Ilustrații: XV, 193 p. 34 illus.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.33 kg
Ediția:1st edition 2017
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

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.