Cantitate/Preț
Produs

Reachability Problems: 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, Proceedings: Lecture Notes in Computer Science, cartea 8169

Editat de Parosh Aziz Abdulla, Igor Potapov
en Limba Engleză Paperback – 13 sep 2013
This book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013. The 19 revised papers (The 14 revised papers were carefully reviewed and selected from 24 submissions in addition to 5 invited talks) were carefully reviewed and selected from 24 submissions. Topics of interest include reachability for finite 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ț: 28520 lei

Preț vechi: 35651 lei
-20% Nou

Puncte Express: 428

Preț estimativ în valută:
5460 5929$ 4592£

Carte tipărită la comandă

Livrare economică 14-28 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642410352
ISBN-10: 3642410359
Pagini: 236
Ilustrații: XII, 223 p. 60 illus.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.34 kg
Ediția:2013
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Reachability for finite 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.