.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Reachability Problems
. Ed(S): Finkel, Alain; Leroux, Jerome; Potapov, Igor
€ 61.41
FREE Delivery in Ireland
Description for Reachability Problems
Paperback. Constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. Editor(s): Finkel, Alain; Leroux, Jerome; Potapov, Igor. Series: Lecture Notes in Computer Science / Theoretical Computer Science and General Issues. Num Pages: 161 pages, 31 black & white illustrations, biography. BIC Classification: UMB; UMX; UMZ; UYA; UYZG. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 8. Weight in Grams: 258.
This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as 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 ... Read more
This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as 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 ... Read more
Product Details
Format
Paperback
Publication date
2012
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
161
Condition
New
Series
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Number of Pages
149
Place of Publication
Berlin, Germany
ISBN
9783642335112
SKU
V9783642335112
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Reachability Problems