Cantitate/Preț
Produs

Reachability Problems: 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011, Proceedings: Lecture Notes in Computer Science, cartea 6945

Editat de Giorgio Delzanno, Igor Potapov
en Limba Engleză Paperback – 19 sep 2011
This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011.The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in algebraic structures, computational models, hybrid systems, logic, and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modelled as games.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 39989 lei

Preț vechi: 49986 lei
-20%

Puncte Express: 600

Preț estimativ în valută:
7069 8429$ 6132£

Carte tipărită la comandă

Livrare economică 16-30 martie


Specificații

ISBN-13: 9783642242878
ISBN-10: 3642242871
Pagini: 260
Ilustrații: XII, 245 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.36 kg
Ediția:2011
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

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011.
The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in algebraic structures, computational models, hybrid systems, logic, and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modelled as games.

Caracteristici

Up-to-date results Fast-track conference proceedings State-of-the-art research